143 search results - page 24 / 29 » Timed CSP: A Retrospective |
CP
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we argue that an attractive and potentially very general way of achieving generalized arc consistency (GAC) on a constraint is by using unit propagation (UP) over a C...
84
Voted
SOFSEM
2007
Springer
15 years 4 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
ISM
2006
IEEE
15 years 4 months ago
2006
IEEE
We consider Multimedia applications where clients specify a minimum desired stream rate (quality) and a time till when they are willing to wait, termed delay tolerance. The Conten...
CSCLP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
101
click to vote
AUSAI
2003
Springer
15 years 3 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...