608 search results - page 2 / 122 » Random Systems with Complete Connections |
ICOIN
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
GLOBECOM
2009
IEEE
13 years 9 months ago
2009
IEEE
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of em...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We present a detailed study about the role of the short-cuts of a network in promoting the emergence of cooperation in a population of agents playing the Prisoner's Dilemma Ga...
COCO
1991
Springer
13 years 9 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
SAGA
2009
Springer
13 years 10 months ago
2009
Springer
