Sciweavers

201 search results - page 19 / 41
» Optimizing an objective function under a bivariate probabili...
Sort
View
UAI
2003
13 years 9 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 7 months ago
Online Algorithms for the Multi-Armed Bandit Problem with Markovian Rewards
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
Cem Tekin, Mingyan Liu
TWC
2008
127views more  TWC 2008»
13 years 7 months ago
Energy-Delay Analysis of MAC Protocols in Wireless Networks
In this paper the tradeoff between energy and delay for wireless networks is studied. A network using a request-to-send (RTS) and clear-to-send (CTS) type medium access control (M...
Shih Yu Chang, Wayne E. Stark, Achilleas Anastasop...
HICSS
2008
IEEE
120views Biometrics» more  HICSS 2008»
14 years 2 months ago
Optimizing the Supplier Selection and Service Portfolio of a SOA Service Integrator
The Service-Oriented Architecture (SOA) paradigm promises to enable software vendors to compose software systems using services purchased from various suppliers. In this paper, we...
Jan Christian Lang, Thomas Widjaja, Peter Buxmann,...