3874 search results - page 463 / 775 » Approximation Algorithms for k-hurdle Problems |
179
click to vote
WINE
2007
Springer
16 years 8 days ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
147
click to vote
AIPS
2003
15 years 7 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
154
click to vote
AAAI
1994
15 years 7 months ago
1994
This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning...
173
click to vote
FOCS
2009
IEEE
16 years 28 days ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
166
Voted
ICRA
2007
IEEE
16 years 15 days ago
2007
IEEE
— We consider the problem of multiple mobile sensor agents tracking the position of one or more moving targets. In our formulation, each agent maintains a target estimate, and ea...