1866 search results - page 132 / 374 » Robust Algorithms and Price of Robustness in Shunting Proble... |
165
click to vote
INFOCOM
2009
IEEE
16 years 24 days ago
2009
IEEE
— We design truthful double spectrum auctions where multiple parties can trade spectrum based on their individual needs. Open, market-based spectrum trading motivates existing sp...
142
click to vote
WEA
2007
Springer
16 years 8 days ago
2007
Springer
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
175
click to vote
SLS
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
159
click to vote
JAIR
2008
15 years 6 months ago
2008
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
183
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
AdaBoost.OC has shown to be an effective method in boosting "weak" binary classifiers for multi-class learning. It employs the Error Correcting Output Code (ECOC) method...