5606 search results - page 657 / 1122 » Randomization Techniques for Graphs. |
190
click to vote
CLUSTER
2008
IEEE
16 years 1 months ago
2008
IEEE
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...
172
click to vote
COMSWARE
2008
IEEE
16 years 1 months ago
2008
IEEE
—In this paper, we have presented a novel algorithm for searching Peer-to-Peer (P2P) networks which forms power law topology. It is completely decentralized in nature and hence i...
193
click to vote
ASIAMS
2007
IEEE
16 years 1 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
251
click to vote
GLOBECOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
208
click to vote
ICRA
2006
IEEE
16 years 1 months ago
2006
IEEE
Abstract— Randomized motion planning techniques are responsible for many of the recent successes in robot control. However, most motion planning algorithms assume perfect and com...