1921 search results - page 170 / 385 » The Student-Project Allocation Problem |
189
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
195
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
193
click to vote
CDC
2008
IEEE
16 years 29 days ago
2008
IEEE
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
199
click to vote
ASIAN
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
178
click to vote
AIPS
1998
15 years 7 months ago
1998
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...