Sciweavers

777 search results - page 37 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 5 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu
EDCC
2008
Springer
13 years 9 months ago
SONDe, a Self-Organizing Object Deployment Algorithm in Large-Scale Dynamic Systems
We present the design, correctness, and analysis of SONDe, a simple fully decentralized object deployment algorithm for highly requested systems. Given an object (service or data)...
Vincent Gramoli, Anne-Marie Kermarrec, Erwan Le Me...
AAAI
2008
13 years 10 months ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams
ICPP
1995
IEEE
13 years 11 months ago
Generalized Algorithm for Parallel Sorting on Product Networks
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
Antonio Fernández, Nancy Eleser, Kemal Efe
DAC
1999
ACM
14 years 8 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...