Sciweavers

2974 search results - page 336 / 595
» Model-Driven Constraint Programming
Sort
View
KR
2004
Springer
15 years 12 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
CP
2003
Springer
15 years 11 months ago
Solving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
Simon de Givry, Javier Larrosa, Pedro Meseguer, Th...
CP
2003
Springer
15 years 11 months ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie
CONCUR
2000
Springer
15 years 11 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
VL
1996
IEEE
162views Visual Languages» more  VL 1996»
15 years 10 months ago
Interactive Authoring of Multimedia Documents
As multimedia applications spread widely, it is crucial for programming and design support systems to handle "time" in multimedia documents effectively and flexibly. This...
Junehwa Song, Michelle Y. Kim, G. Ramalingam, Raym...