1480 search results - page 73 / 296 » Ants can solve constraint satisfaction problems |
100
click to vote
STACS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
CP
2008
Springer
14 years 11 months ago
2008
Springer
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...
113
click to vote
CP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
IV
2002
IEEE
15 years 2 months ago
2002
IEEE
: In computer-aided design, geometric modeling by constraints enables users to describe shapes by relationships called constraints between geometric elements. The problem is to der...
NORDICHI
2004
ACM
15 years 3 months ago
2004
ACM
This paper describes how computer-human interaction in ambient computing environments can be best informed by conceptualizing of such environments as problem solving systems. Typi...