5606 search results - page 267 / 1122 » Randomization Techniques for Graphs. |
180
click to vote
EGH
2010
Springer
15 years 4 months ago
2010
Springer
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
152
click to vote
IJRR
2006
15 years 6 months ago
2006
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization t...
186
click to vote
INFOCOM
2005
IEEE
16 years 3 days 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...
185
click to vote
PIMRC
2008
IEEE
16 years 27 days ago
2008
IEEE
Random beamforming, where each node selects a main beam direction without any coordination with other nodes, has been proposed as a simple technique to improve connectivity in wire...
159
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...