Sciweavers

2294 search results - page 228 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
IWSOS
2007
Springer
15 years 9 months ago
Mercator: Self-organizing Geographic Connectivity Maps for Scalable Ad-Hoc Routing
Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...
Luis A. Hernando, Unai Arronategui
ISCC
2005
IEEE
15 years 8 months ago
Degree-Optimal Deterministic Routing for P2P Systems
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vi...
TIT
2010
97views Education» more  TIT 2010»
14 years 10 months ago
Periodic orbits and equilibria in glass models for gene regulatory networks
Abstract--Glass models are frequently used to model gene regulatory networks. A distinct feature of the Glass model is that its dynamics can be formalized as paths through multi-di...
Igor Zinovik, Yury Chebiryak, Daniel Kroening
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
15 years 9 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
SIGSOFT
1994
ACM
15 years 7 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...