592 search results - page 58 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
113
Voted
ISAAC
1992
Springer
15 years 7 months ago
1992
Springer
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
125
click to vote
ATAL
2010
Springer
15 years 3 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...
143
click to vote
JMLR
2010
15 years 1 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
121
click to vote
TASE
2008
IEEE
15 years 3 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
123
click to vote
ISCAS
2005
IEEE
15 years 8 months ago
2005
IEEE
— Piecewise linear Lyapunov functions are used to design control gain matrices so that closed systems are robust stable and attractive regions are expanded as large as possible i...