13214 search results - page 341 / 2643 » Pseudorandomness for network algorithms |
160
click to vote
NETWORKS
2010
15 years 5 months ago
2010
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
187
click to vote
GCC
2006
Springer
15 years 10 months ago
2006
Springer
Network coordinates provide a practical and efficient way to estimate latencies among hosts in the network. In this paper, we study the problem of designing and implementing a Net...
207
click to vote
ICMLA
2010
15 years 4 months ago
2010
Markov Logic Networks (MLNs) combine Markov Networks and first-order logic by attaching weights to firstorder formulas and viewing them as templates for features of Markov Networks...
180
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
Ad hoc networks formed without the aid of any established infrastructure are typically multi-hop networks. Location dependent contention and "hidden terminal" problem ma...
171
click to vote
WICON
2008
15 years 8 months ago
2008
We consider a pair of nodes with stochastic traffic flows who wish to communicate in a bi-directional communication scenario using intermediate relays in two-hop fashion. Intermed...