![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 35 matches
- 2014
- André Abramé, Djamal Habet:
Maintaining and Handling All Unit Propagation Reasons in Exact Max-SAT Solvers. SOCS 2014: 2-9 - Sandip Aine, Siddharth Swaminathan, Venkatraman Narayanan, Victor Hwang, Maxim Likhachev:
Multi-Heuristic A. SOCS 2014: 207-208 - Abdullah Alsheddy:
The Application of Pareto Local Search to the Single-Objective Quadratic Assignment Problem. SOCS 2014: 194-195 - Tomás Balyo, Lukás Chrpa, Asma Kilani:
On Different Strategies for Eliminating Redundant Actions from Plans. SOCS 2014: 10-18 - Max Barer, Guni Sharon, Roni Stern, Ariel Felner:
Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem. SOCS 2014: 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. SOCS 2014: 28-34 - Pascal Bercher, Shawn Keen, Susanne Biundo:
Hybrid Planning Heuristics Based on Task Decomposition Graphs. SOCS 2014: 35-43 - Zhaoxing Bu, Roni Stern, Ariel Felner, Robert Craig Holte:
A* with Lookahead Re-Evaluated. SOCS 2014: 44-52 - Andrew Joseph Dobson, Kostas E. Bekris:
Improved Heuristic Search for Sparse Motion Planning Data Structures. SOCS 2014: 196-197 - Gaojian Fan, Martin Müller, Robert Holte:
Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions. SOCS 2014: 53-61 - Tadhg Fitzgerald, Yuri Malitsky, Barry O'Sullivan, Kevin Tierney:
ReACT: Real-Time Algorithm Configuration through Tournaments. SOCS 2014: 62-70 - Natalia Flerova, Radu Marinescu, Rina Dechter:
Evaluating Weighted DFS Branch and Bound over Graphical Models. SOCS 2014: 71-79 - Kalin Gochev, Alla Safonova, Maxim Likhachev:
Anytime Tree-Restoring Weighted A* Graph Search. SOCS 2014: 80-88 - Matthew Hatem, Wheeler Ruml:
Bounded Suboptimal Search in Linear Space: New Results. SOCS 2014: 89-96 - Carlos Hernández, Roberto Asín, Jorge A. Baier:
Time-Bounded Best-First Search. SOCS 2014: 97-104 - Carlos Hernández, Jorge A. Baier:
Toward a Search Strategy for Anytime Search in Linear Space Using Depth-First Branch and Bound. SOCS 2014: 198-199 - Sven Koenig, Alexander Reinefeld:
Invited Talks. SOCS 2014 - Richard E. Korf:
How Do You Know Your Search Algorithm and Code Are Correct? SOCS 2014: 200-201 - William Lam, Kalev Kask, Rina Dechter, Alexander Ihler:
Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics. SOCS 2014: 105-113 - Levi H. S. Lelis, Roni Stern, Nathan R. Sturtevant:
Estimating Search Tree Size with Duplicate Detection. SOCS 2014: 114-122 - Carlos Linares López, Roni Stern, Ariel Felner:
Solving the Target-Value Search Problem. SOCS 2014: 202-203 - Yuri Malitsky, Barry O'Sullivan:
Latent Features for Algorithm Selection. SOCS 2014: 123-130 - Alon Milchgrub, Rina Dechter:
STLS: Cycle-Cutset-Driven Local Search For MPE. SOCS 2014: 204-205 - Liron Samama-Kachko, Rami Puzis, Roni Stern, Ariel Felner:
Extended Framework for Target Oriented Network Intelligence Collection. SOCS 2014: 131-138 - Tim Schulte, Thomas Keller:
Balancing Exploration and Exploitation in Classical Planning. SOCS 2014: 139-147 - Guni Sharon, Ariel Felner, Nathan R. Sturtevant:
Exponential Deepening A* for Real-Time Agent-Centered Search. SOCS 2014: 209-210 - Roni Tzvi Stern, Scott Kiesel, Rami Puzis, Ariel Felner, Wheeler Ruml:
Max is More than Min: Solving Maximization Problems with Heuristic Search. SOCS 2014: 148-156 - Ben Strasser, Daniel Harabor, Adi Botea:
Fast First-Move Queries through Run-Length Encoding. SOCS 2014: 157-165 - Nathan R. Sturtevant, Vadim Bulitko:
Reaching the Goal in Real-Time Heuristic Search: Scrubbing Behavior is Unavoidable. SOCS 2014: 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. SOCS 2014: 175-183
skipping 5 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-26 22:54 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint