Sciweavers

725 search results - page 144 / 145
» Bounding Degrees on RPL
Sort
View
COMPGEOM
2005
ACM
13 years 7 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
DAGSTUHL
2006
13 years 6 months ago
Taming Dynamic and Selfish Peers
This paper addresses two important challenges for current P2P systems, namely churn and selfishness. First, we report on a system [19] whose desirable properties (small peer degre...
Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, Rog...
GECCO
2008
Springer
138views Optimization» more  GECCO 2008»
13 years 6 months ago
Modular neuroevolution for multilegged locomotion
Legged robots are useful in tasks such as search and rescue because they can effectively navigate on rugged terrain. However, it is difficult to design controllers for them that ...
Vinod K. Valsalam, Risto Miikkulainen
ENTCS
2008
146views more  ENTCS 2008»
13 years 5 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
CORR
2007
Springer
153views Education» more  CORR 2007»
13 years 5 months ago
Power-Bandwidth Tradeoff in Dense Multi-Antenna Relay Networks
— We consider a dense fading multi-user network with multiple active multi-antenna source-destination pair terminals communicating simultaneously through a large common set of K ...
Ozgur Oyman, Arogyaswami Paulraj