Imagen de Portada

Evolving A* to Efficiently Solve the k Shortest-Path Problem (Extended Version)

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	López, Carlos Linares, Herman, Ian
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Artificial Intelligence 68T20 I.2.8
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Dual-Step Optimization for Binary Sequences with High Merit Factors
por: Pšeničnik, Blaž, et al.
Publicado: (2024)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
por: Shigemizu, Mika, et al.
Publicado: (2018)

Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming
por: van der Linden, Jacobus G. M., et al.
Publicado: (2023)

Algorithm Selection for Optimal Multi-Agent Path Finding via Graph Embedding
por: Shabalin, Carmel, et al.
Publicado: (2024)

Updating Lower and Upper Bounds for the Job-Shop Scheduling Problem Test Instances
por: Graviers, Marc-Emmanuel Coupvent des, et al.
Publicado: (2025)

Many Objective Problems Where Crossover is Provably Essential
por: Opris, Andre
Publicado: (2024)

Savile Row Manual
por: Nightingale, Peter
Publicado: (2021)

Unveiling Interesting Insights: Monte Carlo Tree Search for Knowledge Discovery
por: Totis, Pietro, et al.
Publicado: (2025)

A Computational Proof of the Highest-Scoring Boggle Board
por: Vanderkam, Dan
Publicado: (2025)

Parallel Self-Avoiding Walks for a Low-Autocorrelation Binary Sequences Problem
por: Bošković, Borko, et al.
Publicado: (2022)

A Tight Expressivity Hierarchy for GNN-Based Entity Resolution in Master Data Management
por: Ganesan, Ashwin
Publicado: (2026)

The Traveling Thief Problem with Time Windows: Benchmarks and Heuristics
por: Angmalisang, Helen Yuliana, et al.
Publicado: (2026)

Efficient Contextual Preferential Bayesian Optimization with Historical Examples
por: Khan, Farha A., et al.
Publicado: (2022)

Discovering Algorithms with Computational Language Processing
por: Bourdais, Theo, et al.
Publicado: (2025)

The Marco Polo Problem: A Combinatorial Approach to Geometric Localization
por: Gila, Ofek, et al.
Publicado: (2025)

Space Adaptive Search for Nonholonomic Mobile Robots Path Planning
por: Wang, Qi
Publicado: (2024)

AI Agents: Evolution, Architecture, and Real-World Applications
por: Krishnan, Naveen
Publicado: (2025)

Cooperative Patrol Routing: Optimizing Urban Crime Surveillance through Multi-Agent Reinforcement Learning
por: Palma-Borda, Juan, et al.
Publicado: (2025)

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem
por: Blum, Christian, et al.
Publicado: (2025)

Two-phase Optimization of Binary Sequences with Low Peak Sidelobe Level Value
por: Bošković, Borko, et al.
Publicado: (2021)

Scalable Heterogeneous Graph Foundation Models for Data-Driven Optimal Power Flow in Smart Grids
por: Pasini, Massimiliano Lupo, et al.
Publicado: (2026)

Instruction set for the representation of graphs
por: Lopez-Rubio, Ezequiel, et al.
Publicado: (2026)

STRIDE: A Self-Reflective Agent Framework for Reliable Automatic Equation Discovery
por: Su, Jiarui, et al.
Publicado: (2026)

Proving Olympiad Algebraic Inequalities without Human Demonstrations
por: Wei, Chenrui, et al.
Publicado: (2024)

InterEvo-TR: Interactive Evolutionary Test Generation With Readability Assessment
por: Delgado-Pérez, Pedro, et al.
Publicado: (2024)

Is there a half-life for the success rates of AI agents?
por: Ord, Toby
Publicado: (2025)

JCLEC-MO: a Java suite for solving many-objective optimization engineering problems
por: Ramírez, Aurora, et al.
Publicado: (2024)

From Imitation to Interaction: Mastering Game of Schnapsen with Shallow Reinforcement Learning
por: Klačan, Ján, et al.
Publicado: (2026)

Enhanced Methods for the Weight Constrained Shortest Path Problem
por: Ahmadi, Saman, et al.
Publicado: (2022)

EduQate: Generating Adaptive Curricula through RMABs in Education Settings
por: Tio, Sidney, et al.
Publicado: (2024)

Diffusion-MPC in Discrete Domains: Feasibility Constraints, Horizon Effects, and Critic Alignment: Case study with Tetris
por: Wang, Haochuan Kevin
Publicado: (2026)

Statistical Guarantees for Lifelong Reinforcement Learning using PAC-Bayes Theory
por: Zhang, Zhi, et al.
Publicado: (2024)

Knapsack: Connectedness, Path, and Shortest-Path
por: Dey, Palash, et al.
Publicado: (2023)

$XX^{t}$ Can Be Faster
por: Rybin, Dmitry, et al.
Publicado: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
por: Bubeck, Sébastien, et al.
Publicado: (2022)

Agentic, Context-Aware Risk Intelligence in the Internet of Value
por: Magableh, Basel, et al.
Publicado: (2026)

PLUGH: A Benchmark for Spatial Understanding and Reasoning in Large Language Models
por: Tikhonov, Alexey
Publicado: (2024)

A Hormetic Approach to the Value-Loading Problem: Preventing the Paperclip Apocalypse?
por: Henry, Nathan I. N., et al.
Publicado: (2024)

Murphys Laws of AI Alignment: Why the Gap Always Wins
por: Gaikwad, Madhava
Publicado: (2025)

How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization
por: Sidorov, Konstantin, et al.
Publicado: (2024)