5138 search results - page 43 / 1028 » Randomized Algorithms for 3-SAT |
ISPDC
2008
IEEE
15 years 6 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
115
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
ALENEX
2007
15 years 1 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...