346 search results - page 65 / 70 » Solving quantified constraint satisfaction problems |
ATAL
2003
Springer
15 years 2 months ago
2003
Springer
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
DSS
2008
14 years 9 months ago
2008
The Web is a universal repository of human knowledge and culture which has allowed unprecedented sharing of ideas and information in a scale never seen before. It can also be cons...
CSCLP
2004
Springer
15 years 3 months ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
94
Voted
ECP
1997
Springer
15 years 1 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...