16596 search results - page 201 / 3320 » Generalized Assignment Problems |
174
click to vote
COR
2006
15 years 6 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
186
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
140
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
170
click to vote
INTERSPEECH
2010
15 years 1 months ago
2010
Today there are solutions for some specific turn-taking problems, but no general model. We show how turn-taking can be reduced to two more general problems, prediction and selecti...
179
click to vote
AGENTS
1999
Springer
15 years 10 months ago
1999
Springer
We consider the problem of how to design large decentralized multiagent systems (MAS’s) in an automated fashion, with little or no hand-tuning. Our approach has each agent run a...