103 search results - page 1 / 21 » Consistency and Random Constraint Satisfaction Models |
JAIR
2007
13 years 4 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
CONSTRAINTS
1998
13 years 4 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
CP
1999
Springer
13 years 9 months ago
1999
Springer
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
AICOM
2004
13 years 4 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
ICSOC
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Web portals provide an efficient gateway to a broad range of Eservices, resources and information. Web portals need to evolve towards being adaptive in nature, so that th...