115 search results - page 17 / 23 » Asymptotics for the Probability of Connectedness and the Dis... |
GECCO
2006
Springer
14 years 20 days ago
2006
Springer
This work shows asymptotic convergence to global optima for a family of dynamically scaled genetic programming systems where the underlying population consists of a fixed number o...
SIGECOM
2008
ACM
13 years 9 months ago
2008
ACM
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
RSA
2011
13 years 4 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
STOC
2004
ACM
14 years 2 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...