874 search results - page 126 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
DISOPT
2008
14 years 9 months ago
2008
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
105
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
103
click to vote
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—We consider wireless mesh networks, and exploit the inherent broadcast nature of wireless by making use of multipath routing. We present an optimization framework that enables u...
ET
2002
14 years 9 months ago
2002
We propose an integrated framework for the design of SOC test solutions, which includes a set of algorithms for early design space exploration as well as extensive optimization for...