592 search results - page 112 / 119 » Crossing numbers of random graphs |
141
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
158
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
153
click to vote
GLOBECOM
2006
IEEE
15 years 11 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
163
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
176
click to vote
JAIR
2007
15 years 5 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpli...