143 search results - page 1 / 29 » Timed CSP: A Retrospective |
ENTCS
2006
13 years 4 months ago
2006
CSR
2007
Springer
13 years 10 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
CSCLP
2005
Springer
13 years 10 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
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...
HICSS
2009
IEEE
13 years 11 months ago
2009
IEEE
A common problem in many user studies is gathering natural user behavior unintrusively over a long period of time. We describe a methodology for conducting passive longitudinal st...