1578 search results - page 91 / 316 » Direct Routing: Algorithms and Complexity |
128
Voted
ISPA
2005
Springer
15 years 8 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
128
Voted
PDCAT
2005
Springer
15 years 8 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
124
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
105
Voted
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
112
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...