Sciweavers

250 search results - page 21 / 50
» The complexity of temporal constraint satisfaction problems
Sort
View
FLAIRS
2008
13 years 11 months ago
Distributed University Timetabling with Multiply Sectioned Constraint Networks
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
Yang Xiang, Wanling Zhang
AIPS
2003
13 years 10 months ago
SOFIA's Choice: Scheduling Observations for an Airborne Observatory
We describe the problem of scheduling observations for an airborne astronomical observatory. The problem incorporates complex constraints relating the feasibility of an astronomic...
Jeremy Frank, Elif Kürklü
CSL
2010
Springer
13 years 9 months ago
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
Barnaby Martin, Jos Martin
ECAL
2005
Springer
14 years 2 months ago
Evolutionary Transitions as a Metaphor for Evolutionary Optimisation
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert
AIPS
2008
13 years 11 months ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
Julie A. Shah, Brian C. Williams