359 search results - page 22 / 72 » Online Algorithms for Disk Graphs |
124
click to vote
AI
1998
Springer
14 years 11 months ago
1998
Springer
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
127
click to vote
COMCOM
2006
14 years 11 months ago
2006
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
ESA
2008
Springer
15 years 1 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
102
click to vote
ADBIS
2006
Springer
15 years 5 months ago
2006
Springer
While the cost per megabyte of magnetic disk storage is economical, organizations are alarmed by the increasing cost of managing storage. Storage Area Network (SAN) architectures ...
ISAAC
2000
Springer
15 years 3 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...