250 search results - page 40 / 50 » The complexity of temporal constraint satisfaction problems |
IJCAI
2001
13 years 10 months ago
2001
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
ICLP
2004
Springer
14 years 1 months ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
ENDM
2000
13 years 8 months ago
2000
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
TCSV
2011
13 years 3 months ago
2011
—We present in this paper an integrated solution to rapidly recognizing dynamic objects in surveillance videos by exploring various contextual information. This solution consists...
KI
2005
Springer
14 years 2 months ago
2005
Springer
The point algebra is a fundamental formal calculus for spatial and temporal reasoning. We present a new generalization that meets all requirements to describe dependencies on netw...