31 search results - page 1 / 7 » Dynamic Constraint Weighting for Over-Constrained Problems |
PRICAI
1998
Springer
13 years 12 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
PRICAI
2004
Springer
14 years 1 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...
NECO
1998
13 years 7 months ago
1998
three different levels of abstraction: detailed models including ctivity dynamics, weight dynamics that abstract from the neural activity dynamics by an adiabatic approximation, an...
AAAI
1997
13 years 9 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...