Sciweavers

1140 search results - page 134 / 228
» Progress on Certifying Algorithms
Sort
View
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
14 years 10 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
PODS
2005
ACM
128views Database» more  PODS 2005»
14 years 10 months ago
Operator placement for in-network stream query processing
In sensor networks, data acquisition frequently takes place at lowcapability devices. The acquired data is then transmitted through a hierarchy of nodes having progressively incre...
Utkarsh Srivastava, Kamesh Munagala, Jennifer Wido...
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
14 years 7 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein
CEC
2009
IEEE
14 years 4 months ago
Theoretical analysis of rank-based mutation - combining exploration and exploitation
— Parameter setting is an important issue in the design of evolutionary algorithms. Recently, experimental work has pointed out that it is often not useful to work with a fixed ...
Pietro Simone Oliveto, Per Kristian Lehre, Frank N...
ICRA
2009
IEEE
139views Robotics» more  ICRA 2009»
14 years 4 months ago
Stereo vision and terrain modeling for quadruped robots
— Legged robots offer the potential to navigate highly challenging terrain, and there has recently been much progress in this area. However, a great deal of this recent work has ...
J. Zico Kolter, Youngjun Kim, Andrew Y. Ng