1920 search results - page 243 / 384 » The Range Constraint: Algorithms and Implementation |
155
click to vote
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
125
click to vote
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
140
click to vote
CMSB
2008
Springer
15 years 5 months ago
2008
Springer
Model checking has historically been an important tool to verify models of a wide variety of systems. Typically a model has to exhibit certain properties to be classed `acceptable&...
129
click to vote
AIPS
2006
15 years 5 months ago
2006
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...
136
click to vote
JAIR
2008
15 years 4 months ago
2008
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...