2109 search results - page 137 / 422 » Solving Necklace Constraint Problems |
165
click to vote
BPM
2006
Springer
15 years 9 months ago
2006
Springer
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expres...
149
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this g...
175
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
172
click to vote
PPDP
1999
Springer
15 years 10 months ago
1999
Springer
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations f...
199
click to vote
CP
2008
Springer
15 years 7 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...