Sciweavers

5804 search results - page 1160 / 1161
» Doing more with less
Sort
View
PODC
2009
ACM
15 years 10 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
15 years 7 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
ATAL
2009
Springer
15 years 4 months ago
Caching schemes for DCOP search algorithms
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
William Yeoh, Pradeep Varakantham, Sven Koenig
SASN
2004
ACM
15 years 3 months ago
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
Yih-Chun Hu, David B. Johnson
WSE
2003
IEEE
15 years 3 months ago
Resolution of Static Clones in Dynamic Web Pages
Cloning is extremely likely to occur in web sites, much more so than in other software. While some clones exist for valid reasons, or are too small to eliminate, cloning percentag...
Nikita Synytskyy, James R. Cordy, Thomas R. Dean
« Prev « First page 1160 / 1161 Last » Next »