Sciweavers

2808 search results - page 488 / 562
» Routing betweenness centrality
Sort
View
COMGEO
2006
ACM
14 years 11 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
JGAA
2006
100views more  JGAA 2006»
14 years 11 months ago
Orthogonal Hypergraph Drawing for Improved Visibility
Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses or...
Thomas Eschbach, Wolfgang Günther, Bernd Beck...
MONET
2008
150views more  MONET 2008»
14 years 11 months ago
A Multi-radio 802.11 Mesh Network Architecture
Routers equipped with multiple 802.11 radios can alleviate capacity problems in wireless mesh networks. However, a practical, complete system architecture that can realize the bene...
Krishna N. Ramachandran, Irfan Sheriff, Elizabeth ...
SIGMETRICS
2008
ACM
135views Hardware» more  SIGMETRICS 2008»
14 years 11 months ago
In search of the elusive ground truth: the internet's as-level connectivity structure
Despite significant efforts to obtain an accurate picture of the Internet's actual connectivity structure at the level of individual autonomous systems (ASes), much has remai...
Ricardo V. Oliveira, Dan Pei, Walter Willinger, Be...
AI
1998
Springer
14 years 10 months ago
Utility-Based On-Line Exploration for Repeated Navigation in an Embedded Graph
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...
Shlomo Argamon-Engelson, Sarit Kraus, Sigalit Sina