Sciweavers

566 search results - page 70 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
COORDINATION
2000
Springer
15 years 4 months ago
An Agent Mediated Approach to Dynamic Change in Coordination Policies
Distributed information systems for decision-support, logistics, and e-commerce involve coordination of autonomous information resources and clients according to specific domain in...
Prasanta K. Bose, Mark G. Matthews
ATAL
2003
Springer
15 years 5 months ago
Trade of a problem-solving task
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...
Shigeo Matsubara
CP
2007
Springer
15 years 6 months ago
The Log-Support Encoding of CSP into SAT
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...
Marco Gavanelli
CP
2004
Springer
15 years 4 months ago
Full Dynamic Substitutability by SAT Encoding
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...
Steven David Prestwich
103
Voted
CODES
2008
IEEE
15 years 7 months ago
Cache-aware optimization of BAN applications
Body-area sensor network or BAN-based health monitoring is increasingly becoming a popular alternative to traditional wired bio-monitoring techniques. However, most biomonitoring ...
Yun Liang, Lei Ju, Samarjit Chakraborty, Tulika Mi...