ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “winner-take-all architecture”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGcs.AIRecentMay 30, 2026

CARE-RL: Capability-Aware Reinforcement Learning for Mitigating Cross-Domain Conflicts

Rui Zhang, Xinle Wu, Yao Lu

CARE-RL introduces a framework combining protocol-aware reward generation and capability-aware optimization to effectively mitigate cross-domain conflicts in multi-domain reinforcement learning for LL…

View →
cs.NEcs.CRRecentApr 19, 2026

Monotone but Exciting: On Evolving Monotone Boolean Functions with High Nonlinearity

Claude Carlet, Marko Čupić, Marko Ðurasevic, Domagoj Jakobovic +2 more

The paper investigates the ability of evolutionary computation to discover monotone Boolean functions with high nonlinearity, demonstrating that genetic programming is a highly effective encoding for…

View →
cs.CRcs.AIcs.PLRecentMay 1, 2026

Certified Purity for Cognitive Workflow Executors: From Static Analysis to Cryptographic Attestation

Alan L. McCann

The paper introduces a certified purity architecture that strengthens governance in cognitive workflow systems by replacing insufficient runtime checks with cryptographically attested structural guara…

View →
cs.LOcs.CEcs.ETRecentJun 1, 2026

Federated Formal Verification: Cross-Backend Citation, Cross-Axis Convergence, and AI-Orchestrated Proof Dispatch for Production Systems

Pierre Falda

The paper proposes a federated formal verification architecture that treats verification as a polyglot proof system, successfully validating it on complex production subsystems like a Raft consensus m…

View →
cs.LGcs.AREmpiricalRecentJul 22, 2026

AlphaRoute: Large Language Models as Semantic Optimizers for Multi-Objective Routing

Kabir Murjani, Mishri Bhavsar, Manish I. Patel, Jonti Talukdar

This paper presents AlphaRoute, a multi-objective adaptive search framework for VLSI global routing using Large Language Models as semantic policy optimizers.

View →
cs.AIRecentMay 28, 2026

LLM-Evolved Domain-Independent Heuristics for Symbolic AI Planning

Elliot Gestrin, Jendrik Seipp

This paper introduces the first LLM-generated, domain-independent heuristics for symbolic AI planning, using evolutionary search to surpass the performance of hand-engineered state-of-the-art methods.

View →
cs.AIRecentJun 1, 2026

LLM-Evolved Pattern Generators for Optimal Classical Planning

Windy Phung, Dominik Drexler, Arnaud Lequen, Jendrik Seipp

The paper introduces a novel LLM-driven evolutionary framework to synthesize admissible, domain-specific pattern generators, enabling optimal classical planning with high performance and interpretabil…

View →
cs.SEEmpiricalRecentJul 13, 2026

Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE

Kishan Kumar Ganguly, Tim Menzies

The authors compare and evaluate 20 software configuration optimizers based on six assumptions about the data, and find that no single optimizer outperforms others across all budgets. They propose a t…

View →
cs.AREmpiricalRecentJul 3, 2026

ArchEval: Measuring AI Agents as Computer Architects

Chenyu Wang, Zishen Wan, Jeffrey Ma, Shvetank Prakash +7 more

This paper introduces ArchEval, a benchmark and platform for evaluating LLM agents on computer architecture design and optimization.

View →
cs.ARcs.AIcs.SERecentJun 2, 2026

HighTide: An Agent-Curated Open-Source VLSI Benchmark Suite

Benjamin Goldblatt, Paolo Pedroso, Farhad Modaresi, Ethan Sifferman +1 more

HighTide is an evolving, AI-assisted, open-source benchmark suite for VLSI design, providing a comprehensive and scalable platform for hardware development.

View →
cs.CRcs.LGRecentMay 22, 2026

Less Effort, Shorter Proofs: Reinforcement Learning for Security Protocol Analysis in Tamarin

Matthias Cosler, Cas Cremers, Bernd Finkbeiner, Mohamed Ghanem +1 more

The paper introduces a reinforcement learning framework, inspired by AlphaZero, to automate and improve the proof search process within the Tamarin protocol analysis tool, resulting in shorter and mor…

View →
cs.CLcs.AIcs.LGRecentMay 28, 2026

Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits

Sixue Xing, Haoyu He, Kerui Wu, Zhuo Yang +3 more

The paper proposes BaSE, a multi-armed bandit approach, to optimally allocate a fixed budget of LLM calls across parallel evolutionary search trajectories, significantly improving mean fitness and rel…

View →
cs.AIEmpiricalRecentJun 30, 2026

AxDafny: Agentic Verified Code Generation in Dafny

Benjamin Breen, Austin Letson, Borja Requena Pozo, Leopoldo Sarra

The paper introduces AxDafny, a verifier-guided repair framework that improves verification success in Dafny by generating implementations, invariants, assertions, and termination arguments.

View →
cs.CLcs.SERecentMay 29, 2026

Combinatorial Synthesis: Scaling Code RLVR via Atomic Decomposition and Recombination

Jiasheng Zheng, Boxi Cao, Boxi Yu, Yuzhong Zhang +5 more

The paper introduces Atomic Decomposition and Recombination (ADR), a novel framework that generates genuinely novel and challenging verifiable code tasks, significantly improving the scalability of Re…

View →
cs.ARcs.AIEmpiricalRecentJun 26, 2026

Agentic Hardware Design as Repository-Level Code Evolution

Cunxi Yu, Chenhui Deng, Nathaniel Pinckney, Brucek Khailany

The paper introduces HORIZON, a self-evolving agent framework for hardware design using git operations.

View →
cs.LGcs.AIRecentMay 31, 2026

MViewRouter: Internalizing Geometric Equivariance via Multi-view Alternating Attention for Combinatorial Routing

Shiyan Liu, Bohan Tan, Yaoxin Wu, Yan Jin

MViewRouter proposes a multi-view framework that internalizes geometric equivariance using a Multi-view Alternating Attention mechanism to improve generalization and stabilize training for combinatori…

View →