Sciweavers

492 search results - page 70 / 99
» The number of possibilities for random dating
Sort
View
TIT
2008
106views more  TIT 2008»
13 years 8 months ago
Constrained Sequential Resource Allocation and Guessing Games
In this paper, we consider a constrained sequential resource allocation problem where an individual needs to accomplish a task by repeatedly guessing/investing a sufficient level o...
Nicholas B. Chang, Mingyan Liu
AEI
1999
120views more  AEI 1999»
13 years 8 months ago
Genetic algorithms for designing multihop lightwave network topologies
Multihop lightwave networks are a means of utilizing the large bandwidth of optical fibers. In these networks, each node has a fixed number of transmitters and receivers connected...
Cenk Gazen, Cem Ersoy
RSA
2008
103views more  RSA 2008»
13 years 8 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav
JNS
2010
61views more  JNS 2010»
13 years 7 months ago
Validity and Failure of the Boltzmann Approximation of Kinetic Annihilation
This paper introduces a new method to show the validity of a continuum description for the deterministic dynamics of many interacting particles. Here the many particle evolution is...
Karsten Matthies, Florian Theil
SIGECOM
2010
ACM
135views ECommerce» more  SIGECOM 2010»
13 years 7 months ago
Cooperation in anonymous dynamic social networks
We study the emergence of cooperation in dynamic, anonymous social networks, such as in online communities. We examine prisoner’s dilemma played under a social matching protocol...
Nicole Immorlica, Brendan Lucier, Brian Rogers