4451 search results - page 311 / 891 » On Random Ordering Constraints |
171
click to vote
AAAI
1997
15 years 8 months ago
1997
In order to apply texture measurement based heuristic commitment techniques beyond the unary capacity resource constraints of job shop scheduling, we extend the contention texture...
226
click to vote
IPCO
1998
15 years 8 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
178
click to vote
CAV
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We apply model checking of knowledge properties to the design of distributed controllers that enforce global constraints on concurrent systems. We calculate when processe...
168
click to vote
ECEASST
2008
15 years 6 months ago
2008
Executable UML allows precisely describing the software system at level of abstraction. The executable models can be translated to a less programming language completely or execute...
167
click to vote
JETAI
2008
15 years 6 months ago
2008
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...