13214 search results - page 93 / 2643 » Pseudorandomness for network algorithms |
172
click to vote
SECON
2007
IEEE
16 years 20 days ago
2007
IEEE
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
200
click to vote
ICDCIT
2007
Springer
16 years 16 days ago
2007
Springer
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
166
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
193
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
163
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...