566 search results - page 70 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
151
click to vote
COORDINATION
2000
Springer
15 years 10 months ago
2000
Springer
Distributed information systems for decision-support, logistics, and e-commerce involve coordination of autonomous information resources and clients according to specific domain in...
145
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
147
click to vote
CP
2007
Springer
16 years 5 days ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
154
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...
162
click to vote
CODES
2008
IEEE
16 years 14 days ago
2008
IEEE
Body-area sensor network or BAN-based health monitoring is increasingly becoming a popular alternative to traditional wired bio-monitoring techniques. However, most biomonitoring ...