11 search results - page 1 / 3 » isaac 1999 |
RAID
1999
Springer
14 years 3 months ago
1999
Springer
ISAAC
1999
Springer
14 years 3 months ago
1999
Springer
This paper considers recon gurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the motion. We prove that one can recon gure any monoton...
ISAAC
1999
Springer
14 years 3 months ago
1999
Springer
We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...
ISAAC
1999
Springer
14 years 3 months ago
1999
Springer
We study the online problem of holding a number of idle threads on an application server, which we have ready for processing new requests. The problem stems from the fact that bot...
ISAAC
1999
Springer
14 years 3 months ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...