Sciweavers

235 search results - page 19 / 47
» An efficient consistency algorithm for the Temporal Constrai...
Sort
View
116
Voted
AIMSA
2008
Springer
15 years 10 months ago
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
Roman Barták, Ondrej Cepek
123
Voted
AIPS
2006
15 years 5 months ago
Tractable Optimal Competitive Scheduling
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
Jeremy Frank, James Crawford, Lina Khatib, Ronen I...
124
Voted
CP
2008
Springer
15 years 5 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
117
Voted
ECAI
2006
Springer
15 years 7 months ago
Inverse Consistencies for Non-Binary Constraints
We present a detailed study of two inverse consistencies for non-binary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These ar...
Kostas Stergiou, Toby Walsh
127
Voted
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 7 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller