717 search results - page 95 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
AAAI
2007
15 years 4 days ago
2007
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
IJCAI
2007
14 years 11 months ago
2007
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
ECAI
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We propose here a new approach for video sequence interpretation based on declarative models of activities. The aim of the video sequence interpretation is to recognize i...
SAC
2009
ACM
15 years 4 months ago
2009
ACM
Shelf space allocation is the problem of efficiently arranging retail products on shelves in order to maximise profit, improve stock control, improve customer satisfaction, etc. ...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...