Sciweavers

3049 search results - page 541 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 3 months ago
Online Learning of Rested and Restless Bandits
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
Cem Tekin, Mingyan Liu
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
13 years 15 days ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
14 years 3 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini
MMSP
2008
IEEE
147views Multimedia» more  MMSP 2008»
14 years 3 months ago
Bit allocation for spatial scalability in H.264/SVC
Abstract—We propose a model-based spatial layer bit allocation algorithm for H.264/SVC in this work. The spatial scalability of H.264/SVC is achieved by a multi-layer approach, w...
Jiaying Liu, Yongjin Cho, Zongming Guo, C. C. Jay ...
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz