Sciweavers

914 search results - page 106 / 183
» Branch and Bound on the Network Model
Sort
View
CORR
2008
Springer
139views Education» more  CORR 2008»
14 years 10 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi
PPL
1998
117views more  PPL 1998»
14 years 9 months ago
Messy Broadcasting
In this paper, we describe an ordering of the vertices of a 2-dimensional torus and study the upper bound on the orderly broadcast time. Along with messy broadcasting, orderly bro...
Hovhannes A. Harutyunyan, Arthur L. Liestman
ATAL
2010
Springer
14 years 11 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
14 years 9 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald
TCBB
2008
117views more  TCBB 2008»
14 years 9 months ago
Consensus Genetic Maps as Median Orders from Inconsistent Sources
A genetic map is an ordering of genetic markers calculated from a population of known lineage. Although, traditionally, a map has been generated from a single population for each s...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...