5138 search results - page 109 / 1028 » Randomized Algorithms for 3-SAT |
120
Voted
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
We propose a simple approach to visualising the time behaviour of Random Boolean Networks (RBNs), and demonstrate the approach by examining the effect of canalising functions for ...
106
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
100
click to vote
CDES
2006
15 years 3 months ago
2006
The ability to improve the yield of integrated circuits through layout modification has been recognized and several techniques for yield enhanced routing and compaction have been ...
103
click to vote
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
126
Voted
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...