3875 search results - page 499 / 775 » Approximation algorithms for the 0-extension problem |
177
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
147
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
197
click to vote
WINE
2007
Springer
16 years 23 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...
159
click to vote
AIPS
2003
15 years 8 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...
167
click to vote
AAAI
1994
15 years 8 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...