IJCGA
2010
13 years 3 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
SODA
1993
ACM
13 years 5 months ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
DAGSTUHL
1996
13 years 5 months ago
1996
The areas of On-Line Algorithms and Machine Learning are both concerned with problems of making decisions about the present based only on knowledge of the past. Although these area...
SODA
1997
ACM
13 years 5 months ago
1997
ACM
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
SODA
1998
ACM
13 years 5 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
COCOON
2005
Springer
13 years 6 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
RTSS
1994
IEEE
13 years 8 months ago
1994
IEEE
The problem of uniprocessor scheduling under conditions of overload is investigated. The system objective is to maximzze the number of tasks that complete by their deadlines. For ...
SIGMETRICS
2004
ACM
13 years 10 months ago
2004
ACM
— The volume of multimedia data, including video, served through Peer-to-Peer (P2P) networks is growing rapidly. Unfortunately, high bandwidth transfer rates are rarely available...