327 search results - page 52 / 66 » Exploiting Problem Decomposition in Multi-objective Constrai... |
COCOA
2009
Springer
14 years 3 months ago
2009
Springer
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
ICRA
1998
IEEE
14 years 22 days ago
1998
IEEE
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
AI
2006
Springer
13 years 8 months ago
2006
Springer
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
ATAL
2006
Springer
14 years 7 days ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...