566 search results - page 15 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
152
click to vote
AMAI
1999
Springer
15 years 5 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
165
click to vote
AAAI
2006
15 years 6 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
179
click to vote
CONSTRAINTS
2010
15 years 5 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
165
Voted
WLP
2004
Springer
15 years 10 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
154
click to vote
MOBIQUITOUS
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in ...