2861 search results - page 337 / 573 » Constraint Programming |
182
click to vote
ROBOCUP
1999
Springer
15 years 10 months ago
1999
Springer
In this paper, we present a multi-layered architecture for spatial and temporal agents. The focus is laid on the declarativity of the approach, which makes agent scripts expressive...
163
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
190
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
The need of formal verification is a problem that involves all the fields in which sensible data are managed. In this context the verification of data streams became a fundamental...
280
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
154
click to vote
CP
2009
Springer
16 years 1 months ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...