Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. SOCS 2014: Prague, Czech Republic
- Stefan Edelkamp, Roman Barták:
Proceedings of the Seventh Annual Symposium on Combinatorial Search, SOCS 2014, Prague, Czech Republic, 15-17 August 2014. AAAI Press 2014, ISBN 978-1-57735-676-9 - SoCS 2014 Organization.
- Sven Koenig, Alexander Reinefeld:
Invited Talks. - Preface.
Full Papers
- André Abramé, Djamal Habet:
Maintaining and Handling All Unit Propagation Reasons in Exact Max-SAT Solvers. 2-9 - Tomás Balyo, Lukás Chrpa, Asma Kilani:
On Different Strategies for Eliminating Redundant Actions from Plans. 10-18 - Max Barer, Guni Sharon, Roni Stern, Ariel Felner:
Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem. 19-27 - Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion, Vincent Vigneron:
On the Attainability of NK Landscapes Global Optima. 28-34 - Pascal Bercher, Shawn Keen, Susanne Biundo:
Hybrid Planning Heuristics Based on Task Decomposition Graphs. 35-43 - Zhaoxing Bu, Roni Stern, Ariel Felner, Robert Craig Holte:
A* with Lookahead Re-Evaluated. 44-52 - Gaojian Fan, Martin Müller, Robert Holte:
Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions. 53-61 - Tadhg Fitzgerald, Yuri Malitsky, Barry O'Sullivan, Kevin Tierney:
ReACT: Real-Time Algorithm Configuration through Tournaments. 62-70 - Natalia Flerova, Radu Marinescu, Rina Dechter:
Evaluating Weighted DFS Branch and Bound over Graphical Models. 71-79 - Kalin Gochev, Alla Safonova, Maxim Likhachev:
Anytime Tree-Restoring Weighted A* Graph Search. 80-88 - Matthew Hatem, Wheeler Ruml:
Bounded Suboptimal Search in Linear Space: New Results. 89-96 - Carlos Hernández, Roberto Asín, Jorge A. Baier:
Time-Bounded Best-First Search. 97-104 - William Lam, Kalev Kask, Rina Dechter, Alexander Ihler:
Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics. 105-113 - Levi H. S. Lelis, Roni Stern, Nathan R. Sturtevant:
Estimating Search Tree Size with Duplicate Detection. 114-122 - Yuri Malitsky, Barry O'Sullivan:
Latent Features for Algorithm Selection. 123-130 - Liron Samama-Kachko, Rami Puzis, Roni Stern, Ariel Felner:
Extended Framework for Target Oriented Network Intelligence Collection. 131-138 - Tim Schulte, Thomas Keller:
Balancing Exploration and Exploitation in Classical Planning. 139-147 - Roni Tzvi Stern, Scott Kiesel, Rami Puzis, Ariel Felner, Wheeler Ruml:
Max is More than Min: Solving Maximization Problems with Heuristic Search. 148-156 - Ben Strasser, Daniel Harabor, Adi Botea:
Fast First-Move Queries through Run-Length Encoding. 157-165 - Nathan R. Sturtevant, Vadim Bulitko:
Reaching the Goal in Real-Time Heuristic Search: Scrubbing Behavior is Unavoidable. 166-174 - Nathan R. Sturtevant, Ariel Felner, Malte Helmert:
Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters. 175-183 - Christopher Makoto Wilt, Wheeler Ruml:
Speedy Versus Greedy Search. 184-192
Research Abstracts
- Abdullah Alsheddy:
The Application of Pareto Local Search to the Single-Objective Quadratic Assignment Problem. 194-195 - Andrew Joseph Dobson, Kostas E. Bekris:
Improved Heuristic Search for Sparse Motion Planning Data Structures. 196-197 - Carlos Hernández, Jorge A. Baier:
Toward a Search Strategy for Anytime Search in Linear Space Using Depth-First Branch and Bound. 198-199 - Richard E. Korf:
How Do You Know Your Search Algorithm and Code Are Correct? 200-201 - Carlos Linares López, Roni Stern, Ariel Felner:
Solving the Target-Value Search Problem. 202-203 - Alon Milchgrub, Rina Dechter:
STLS: Cycle-Cutset-Driven Local Search For MPE. 204-205
Extended Abstracts
- Sandip Aine, Siddharth Swaminathan, Venkatraman Narayanan, Victor Hwang, Maxim Likhachev:
Multi-Heuristic A. 207-208 - Guni Sharon, Ariel Felner, Nathan R. Sturtevant:
Exponential Deepening A* for Real-Time Agent-Centered Search. 209-210 - Tansel Uras, Sven Koenig:
Identifying Hierarchies for Fast Optimal Search. 211-212
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
