Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
algorithm completeness
Description:
A property of an algorithm indicating whether it is guaranteed to find a solution when one exists, particularly in search and formal methods.
Related topics:
Robotic Path Planning Algorithms (20%),
Constraint Satisfaction and Optimization (18%),
Logic, programming, and type systems (10%)
OpenAlex ID:
keywords/algorithm-completeness
The distributed constraint satisfaction problem: formalization and algorithms
1998
·
M. Yokoo
, E.H. Durfee
, et al.
·
IEEE Transactions on Knowledge and Data Engineering
·
717
The breakout method for escaping from local minima
1993
·
Paul Morris
·
National Conference on Artificial Intelligence
·
373
Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
2004
·
Weixiong Zhang
, Guandong Wang
, et al.
·
Artificial Intelligence
·
340
Reduction algorithms based on discernibility matrix: The ordered attributes method
2001
·
Jue Wang
, Ju Wang
·
Journal of Computer Science and Technology
·
223
An Alternative Way to Analyze Workflow Graphs
2002
·
W. M. P. van der Aalst
, A. Hirnschall
, et al.
·
Notes on numerical fluid mechanics and multidisciplinary design
·
187
PDF
An algorithm for the medial axis transform of 3D polyhedral solids
1996
·
E.C. Sherbrooke
, N.M. Patrikalakis
, et al.
·
IEEE Transactions on Visualization and Computer Graphics
·
169
Push and Rotate: a Complete Multi-agent Pathfinding Algorithm
2014
·
B. de Wilde
, A. W. Ter Mors
, et al.
·
Journal of Artificial Intelligence Research
·
162
PDF
Asynchronous weak-commitment search for solving distributed constraint satisfaction problems
1995
·
Makoto Yokoo
·
Lecture notes in computer science
·
154
Multiagent truth maintenance
1991
·
M.N. Huhns
, D.M. Bridgeland
·
IEEE Transactions on Systems Man and Cybernetics
·
122
Decidability of conversion for type theory in type theory
2017
·
Andreas Abel
, Joakim Öhman
, et al.
·
Proceedings of the ACM on Programming Languages
·
107
PDF
The kinematic roadmap: a motion planning based global approach for inverse kinematics of redundant robots
1999
·
J.M. Ahuactzin
, K.K. Gupta
·
IEEE Transactions on Robotics and Automation
·
106
The Design and Analysis of an Efficient Local Algorithm for Coverage and Exploration Based on Sensor Network Deployment
2007
·
Maxim A. Batalin
, Gaurav S. Sukhatme
·
IEEE Transactions on Robotics
·
102
Weak-commitment search for solving constraint satisfaction problems
1994
·
Makoto Yokoo
·
National Conference on Artificial Intelligence
·
101
Towards robust on-line multi-robot coverage
2006
·
N. Hazon
, F. Mieli
, et al.
·
Proceedings - IEEE International Conference on Robotics and Automation/Proceedings
·
100
Solving hard qualitative temporal reasoning problems: evaluating the efficiency of using the ORD-Horn class
1996
·
Nebel, Bernhard
·
98
Push and rotate: cooperative multi-agent path planning
2013
·
Boris de Wilde
, Adriaan W. ter Mors
, et al.
·
Adaptive Agents and Multi-Agents Systems
·
88
A novel graph reduction algorithm to identify structural conflicts
2003
·
Hao Lin
, Zhibiao Zhao
, et al.
·
Hawaii International Conference on System Sciences (HICSS)
·
85
Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
1997
·
Bernhard Nebel
·
Constraints
·
82
Push and rotate: cooperative multi-agent path planning
2013
·
Boris de Wilde
, Adriaan W. ter Mors
, et al.
·
Adaptive Agents and Multi-Agents Systems
·
77
The Analysis of an Efficient Algorithm for Robot Coverage and Exploration based on Sensor Network Deployment
2006
·
M.A. Batalin
, G.S. Sukhatme
·
Proceedings - IEEE International Conference on Robotics and Automation/Proceedings
·
71
A New Algorithm for Strategy Synthesis in LTL Games
2005
·
Aidan Harding
, Mark Ryan
, et al.
·
Lecture notes in computer science
·
44
PDF
Analysis of approximate factorization algorithm I
1992
·
Tateaki Sasaki
, Tomokatsu Saito
, et al.
·
Japan Journal of Industrial and Applied Mathematics
·
43
Distributed Truth Maintenance
1991
·
Michael N. Huhns
, David M. Bridgeland
·
Springer eBooks
·
43
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
2011
·
Pierre-Alain Reynier
, Frédéric Servais
·
Lecture notes in computer science
·
42
Controller synthesis with inductive proofs for piecewise linear systems: An SMT-based algorithm
2015
·
Zhenqi Huang
, Yu Wang
, et al.
·
IEEE Conference on Decision and Control (CDC)
·
41
PDF
Show more works
View as search
Works count:
171
Citation count:
4,576
Year
Topic
Type