Sciweavers

1506 search results - page 210 / 302
» On the Distribution of Natural Probability Functions
Sort
View
INFOCOM
2007
IEEE
15 years 11 months ago
Ranking-Based Optimal Resource Allocation in Peer-to-Peer Networks
—This paper presents a theoretic framework of optimal resource allocation and admission control for peer-topeer networks. Peer’s behavioral rankings are incorporated into the r...
Yonghe Yan, Adel El-Atawy, Ehab Al-Shaer
MASCOTS
2007
15 years 6 months ago
A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
— We propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connec...
Deniz Cokuslu, Kayhan Erciyes
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 4 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
176
Voted
PPSN
1994
Springer
15 years 8 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob
137
Voted
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 4 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah