Sciweavers

474 search results - page 36 / 95
» On Multicast Path Finding Algorithms
Sort
View
SEMWEB
2005
Springer
14 years 1 months ago
Finding and Ranking Knowledge on the Semantic Web
Abstract. Swoogle helps software agents and knowledge engineers find Semantic Web knowledge encoded in RDF and OWL documents on the Web. Navigating such a Semantic Web on the Web ...
Li Ding, Rong Pan, Timothy W. Finin, Anupam Joshi,...
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
13 years 7 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
ISPD
1999
ACM
89views Hardware» more  ISPD 1999»
14 years 15 hour ago
VIA design rule consideration in multi-layer maze routing algorithms
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
Jason Cong, Jie Fang, Kei-Yong Khoo
TON
2010
221views more  TON 2010»
13 years 2 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
GD
2006
Springer
13 years 11 months ago
Simultaneous Graph Embedding with Bends and Circular Arcs
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
Justin Cappos, Alejandro Estrella-Balderrama, J. J...