Sciweavers

1594 search results - page 139 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
ICPPW
2006
IEEE
15 years 9 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
IPPS
2002
IEEE
15 years 8 months ago
Reliable Communication in Faulty Star Networks
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
Khaled Day, Abdel Elah Al-Ayyoub
HPDC
2002
IEEE
15 years 8 months ago
A Scalable QoS-Aware Service Aggregation Model for Peer-to-Peer Computing Grids
Peer-to-peer (P2P) computing grids consist of peer nodes that communicate directly among themselves through wide-area networks and can act as both clients and servers. These syste...
Xiaohui Gu, Klara Nahrstedt
FLAIRS
2006
15 years 4 months ago
Simulated Visual Perception-Based Control for Autonomous Mobile Agents
Autonomous robots, such as automatic vacuum cleaners, toy robot dogs, and autonomous vehicles for the military, are rapidly becoming a part of everyday life. As a result the need ...
Daniel Flower, Burkhard Wünsche, Hans W. Gues...
111
Voted
COCOON
2007
Springer
15 years 9 months ago
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
Chiranjeeb Buragohain, Subhash Suri, Csaba D. T&oa...