Sciweavers

467 search results - page 60 / 94
» Acceleration of Shortest Path and Constrained Shortest Path ...
Sort
View
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
14 years 2 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
INFOCOM
2009
IEEE
14 years 2 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
SIGCOMM
1989
ACM
13 years 11 months ago
The Revised ARPANET Routing Metric
The ARPANBT routing metric wasrevised in July 1987,resulting in substantial performance improvements, especially in terms of user delay and effective network capacity. These revis...
A. Khanna, John A. Zinky
CN
2000
84views more  CN 2000»
13 years 7 months ago
Persistent route oscillations in inter-domain routing
Hop-by-hop inter-domain routing protocols, such as BGP and IDRP, use independent route selection to realize domains' local policies. A domain chooses its routes based on path...
Kannan Varadhan, Ramesh Govindan, Deborah Estrin
DBA
2004
93views Database» more  DBA 2004»
13 years 8 months ago
A Query Language Solution for Fastest Flight Connections
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
J. A. Bakker, J. H. ter Bekke