Sciweavers

231 search results - page 18 / 47
» Stochastic Optimization is (Almost) as easy as Deterministic...
Sort
View
SIGECOM
2004
ACM
112views ECommerce» more  SIGECOM 2004»
14 years 29 days ago
Self-interested automated mechanism design and implications for optimal combinatorial auctions
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm
ICIP
2003
IEEE
14 years 25 days ago
Stochastic rate-control of interframe video coders for VBR channels
We propose a new algorithm for the real-time control of an interframe video coder operating with a variable rate channel such as wireless channels or the Internet. Using technique...
Julián Cabrera, José Ignacio Ronda, ...
FOCS
2004
IEEE
13 years 11 months ago
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
Brian C. Dean, Michel X. Goemans, Jan Vondrá...
CSB
2005
IEEE
115views Bioinformatics» more  CSB 2005»
14 years 1 months ago
A New Clustering Strategy with Stochastic Merging and Removing Based on Kernel Functions
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
Huimin Geng, Hesham H. Ali
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...