191 search results - page 7 / 39 » Reformulating Constraint Satisfaction Problems to Improve Sc... |
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
ICCD
2007
IEEE
14 years 4 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
CP
2004
Springer
14 years 1 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...
AGENTS
2001
Springer
14 years 12 days ago
2001
Springer
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or ju...
CP
1995
Springer
13 years 11 months ago
1995
Springer
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...