Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. SOCS 2017: Pittsburgh, Pennsylvania, USA
- Alex Fukunaga, Akihiro Kishimoto:
Proceedings of the Tenth International Symposium on Combinatorial Search, SOCS 2017, 16-17 June 2017, Pittsburgh, Pennsylvania, USA. AAAI Press 2017
Long Papers
- Vincent A. Cicirello:
Variable Annealing Length and Parallelism in Simulated Annealing. 2-10 - Eldan Cohen, J. Christopher Beck:
Cost-Based Heuristics and Node Re-Expansions across the Phase Transition. 11-19 - Federico Falcone, Alfonso Emilio Gerevini, Alessandro Saetti:
On Realizing Planning Programs in Domains with Dead-End States. 20-28 - Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, Pavel Surynek:
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. 29-37 - Maximilian Fickert
, Jörg Hoffmann:
Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning. 38-46 - Manuel Heusner, Thomas Keller, Malte Helmert:
Understanding the Search Behaviour of Greedy Best-First Search. 47-55 - Seongsoo Moon, Mary Inaba:
Boost SAT Solver with Hybrid Branching Heuristic. 56-63 - Shunhao Oh, Hon Wai Leong:
Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths. 64-72 - Gerald Paul, Gabriele Röger, Thomas Keller, Malte Helmert:
Optimal Solutions to Large Logistics Planning Domain Problems. 73-81 - Eshed Shaham, Ariel Felner, Jingwei Chen, Nathan R. Sturtevant:
The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search. 82-90 - Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz:
Strengthening Canonical Pattern Databases with Structural Symmetries. 91-99 - Tansel Uras, Sven Koenig:
Feasibility Study: Subgoal Graphs on State Lattices. 100-108 - Richard Anthony Valenzano, Danniel Sihui Yang:
An Analysis and Enhancement of the Gap Heuristic for the Pancake Puzzle. 109-117
Short Papers
- Daniel Gilon, Ariel Felner, Roni Stern:
Dynamic Potential Search on Weighted Graphs. 119-123 - Daniel Gnad, Álvaro Torralba, Jörg Hoffmann:
Symbolic Leaf Representation in Decoupled Search. 124-128 - Malte Helmert, Nathan R. Sturtevant, Ariel Felner:
On Variable Dependencies and Compressed Pattern Databases. 129-133 - Satoru Horie, Alex S. Fukunaga:
Block-Parallel IDA* for GPUs. 134-138 - Nicolás Hormazábal, Antonio Díaz, Carlos Hernández, Jorge A. Baier:
Fast and Almost Optimal Any-Angle Pathfinding Using the 2k Neighborhoods. 139-143 - Francesco Percassi, Alfonso Emilio Gerevini, Hector Geffner:
Improving Plan Quality through Heuristics for Guiding and Pruning the Search: A Study Using LAMA. 144-148 - Jendrik Seipp:
Better Orders for Saturated Cost Partitioning in Optimal Classical Planning. 149-153
Extended Abstracts
- Johannes Aldinger, Bernhard Nebel:
Interval Based Relaxation Heuristics for Numeric Planning with Action Costs. 155-156 - Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
k-Robust Multi-Agent Path Finding. 157-158 - Alberto Camacho, Oscar Chen, Scott Sanner, Sheila A. McIlraith:
Non-Markovian Rewards Expressed in LTL: Guiding Search Via Reward Shaping. 159-160 - Ishani Chatterjee, Maxim Likhachev, Manuela M. Veloso:
Search Reduction through Conservative Abstract-Space Based Heuristic. 161-162 - Stefan Edelkamp, Eike Externest, Sebastian Kühl, Sabine Kuske:
Solving Graph Optimization Problems in a Framework for Monte-Carlo Search. 163-164 - Nils Christian Froleyks, Tomás Balyo:
Using an Algorithm Portfolio to Solve Sokoban. 165-166 - Roni Tzvi Stern, Meir Goldenberg, Ariel Felner:
Shortest Path for K Goals. 167-168 - Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. 169-170 - Mauro Vallati, Lukás Chrpa, Thomas Leo McCluskey:
Improving a Planner's Performance through Online Heuristic Configuration of Domain Models. 171-172 - Hong Xu, T. K. Satish Kumar, Sven Koenig:
A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. 173-174
Previously Published Paper Summaries
- Alex Fukunaga, Akihiro Kishimoto:
Abstracts of Papers Presented at SoCS 2017 in the Previously Published Paper Track. 176-178
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-06-10 21:42 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:
