SCHEDULING
2011
12 years 11 months ago
2011
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â€...
ICONIP
2009
13 years 2 months ago
2009
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...
GLOBECOM
2009
IEEE
13 years 2 months ago
2009
IEEE
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...
COLT
2010
Springer
13 years 2 months ago
2010
Springer
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...
ENDM
2010
13 years 4 months ago
2010
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
ALGORITHMICA
2010
13 years 4 months ago
2010
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...
ALGORITHMICA
2010
13 years 4 months ago
2010
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...
AIPS
2009
13 years 5 months ago
2009
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...
WCE
2007
13 years 5 months ago
2007
—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 ...