Sciweavers

1647 search results - page 145 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
WSC
2008
15 years 9 months ago
Discrete stochastic optimization using linear interpolation
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
Honggang Wang, Bruce W. Schmeiser
ECRTS
2006
IEEE
16 years 1 months ago
The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
Nathan Fisher, Sanjoy K. Baruah, Theodore P. Baker
ESA
2009
Springer
156views Algorithms» more  ESA 2009»
16 years 1 months ago
On Revenue Maximization in Second-Price Ad Auctions
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, ...
250
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
PAMI
2010
207views more  PAMI 2010»
15 years 2 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf