Sciweavers

597 search results - page 67 / 120
» Homomorphisms of random paths
Sort
View
ASAP
2007
IEEE
95views Hardware» more  ASAP 2007»
14 years 4 months ago
Performance Evaluation of Probe-Send Fault-tolerant Network-on-chip Router
With increasing reliability concerns for current and next generation VLSI technologies, fault-tolerance is fast becoming an integral part of system-on-chip and multicore architect...
Sumit D. Mediratta, Jeffrey T. Draper
IROS
2007
IEEE
160views Robotics» more  IROS 2007»
14 years 4 months ago
Task constrained motion planning in robot joint space
— We explore global randomized joint space path planning for articulated robots that are subject to task space constraints. This paper describes a representation of constrained m...
Mike Stilman
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 4 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
ICDCSW
2006
IEEE
14 years 4 months ago
Improve Searching by Reinforcement Learning in Unstructured P2Ps
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
Xiuqi Li, Jie Wu
ICPPW
2006
IEEE
14 years 4 months ago
Parallel Implementation of the Polyhedral Homotopy Method
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
Jan Verschelde, Yan Zhuang