Sciweavers

Share
SCHEDULING
2011
9 years 6 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs...
Michael Gatto, Peter Widmayer
ICONIP
2009
9 years 9 months ago
A Markov Model for Multiagent Patrolling in Continuous Time
Abstract. We present a model for the multiagent patrolling problem with continuous-time. An anytime and online algorithm is then described and extended to asynchronous multiagent d...
Jean-Samuel Marier, Camille Besse, Brahim Chaib-dr...
GLOBECOM
2009
IEEE
9 years 9 months ago
Joint Scheduling and Instantaneously Decodable Network Coding
We consider a wireless multi-hop network and design an algorithm for jointly optimal scheduling of packet transmissions and network coding. We consider network coding across differ...
Danail Traskov, Muriel Médard, Parastoo Sad...
COLT
2010
Springer
9 years 9 months ago
Learning Rotations with Little Regret
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
Elad Hazan, Satyen Kale, Manfred K. Warmuth
ENDM
2010
130views more  ENDM 2010»
9 years 11 months ago
Experimental Analysis of an Online Trading Algorithm
Trading decisions in financial markets can be supported by the use of online algorithms. We evaluate the empirical performance of a threat-based online algorithm and compare it to...
Günter Schmidt, Esther Mohr, Mike Kersch
CORR
2010
Springer
105views Education» more  CORR 2010»
9 years 11 months ago
Online Identification and Tracking of Subspaces from Highly Incomplete Information
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
Laura Balzano, Robert Nowak, Benjamin Recht
ALGORITHMICA
2010
143views more  ALGORITHMICA 2010»
9 years 11 months ago
Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye,...
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
9 years 11 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
AIPS
2009
10 years 22 days ago
Multi-Agent Online Planning with Communication
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
WCE
2007
10 years 23 days ago
A Competitive Online Algorithm for File Restriping
—We present a 3-competitive online algorithm for determining when to restripe a file for the case when the optimum stripe depth can take one of two possible values, depending on ...
Mario R. Medina
books