1480 search results - page 184 / 296 » Ants can solve constraint satisfaction problems |
145
click to vote
CP
2007
Springer
16 years 22 days ago
2007
Springer
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...
184
click to vote
SPATIALCOGNITION
2004
Springer
15 years 12 months ago
2004
Springer
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
162
click to vote
CODES
1998
IEEE
15 years 10 months ago
1998
IEEE
Timing analysis for checking satisfaction of constraints is a crucial problem in real-time system design. In some current approaches, the delay of software modules is precalculate...
184
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
154
click to vote
AAAI
2007
15 years 9 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...