5473 search results - page 711 / 1095 » On the graph isomorphism problem |
189
click to vote
IJCAI
2003
15 years 8 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
197
click to vote
APDC
1997
15 years 8 months ago
1997
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...
146
click to vote
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Most existing structure-from-motion methods follow a common two-step scheme, where relative camera motions are estimated in the first step and 3D structure is computed afterward ...
214
Voted
AI
2010
Springer
15 years 6 months ago
2010
Springer
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...
183
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...