Sciweavers

53 search results - page 8 / 11
» Exploiting the Constrainedness in Constraint Satisfaction Pr...
Sort
View
ECAI
2000
Springer
14 years 27 days ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta
ENDM
2000
116views more  ENDM 2000»
13 years 8 months ago
Conceptual Models for Combined Planning and Scheduling
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
Roman Barták
AI
2003
Springer
14 years 1 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
CONSTRAINTS
2008
107views more  CONSTRAINTS 2008»
13 years 8 months ago
A Constraint-Based Autonomous 3D Camera System
Camera control techniques for Interactive Digital Entertainment (IDE) are reaching their limits in terms of capabilities. To enable future growth, new methods must be derived to a...
Owen Bourne, Abdul Sattar, Scott D. Goodwin
ICTAI
2002
IEEE
14 years 1 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali