4377 search results - page 244 / 876 » Mass problems and randomness |
138
click to vote
AAECC
2002
Springer
15 years 6 months ago
2002
Springer
A fruitful interaction between a new randomized WZ procedure and other computer algebra programs is illustrated by the computer proof of a series evaluation that originates from a ...
195
click to vote
IPL
2000
15 years 6 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
177
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
204
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes...
162
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...