10608 search results - page 485 / 2122 » Complexity of O'Hara's Algorithm |
157
Voted
AUTOMATICA
2011
15 years 1 days ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
173
click to vote
AI
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
124
Voted
ICSM
2002
IEEE
15 years 10 months ago
2002
IEEE
We present an empirical evaluation of three contextsensitive slicing algorithms and five context-sensitive chopping algorithms, and compare them to context-insensitive methods. B...
121
click to vote
COMGEO
2010
ACM
15 years 3 months ago
2010
ACM
Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
123
Voted
TPDS
2008
15 years 4 months ago
2008
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...