53 search results - page 7 / 11 » Asynchronous Partial Overlay: A New Algorithm for Solving Di... |
128
Voted
CP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
136
Voted
CP
2008
Springer
15 years 4 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...
127
Voted
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
239
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
138
Voted
PRICAI
2004
Springer
15 years 8 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...