350 search results - page 53 / 70 » Uncertainty in Soft Constraint Problems |
JAIR
2007
13 years 7 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
AGP
2003
IEEE
14 years 1 months ago
2003
IEEE
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
ATAL
2003
Springer
14 years 28 days ago
2003
Springer
Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and ...