5138 search results - page 86 / 1028 » Randomized Algorithms for 3-SAT |
122
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
123
Voted
CEC
2005
IEEE
15 years 7 months ago
2005
IEEE
Several approaches have been developed into evolutionary algorithms to deal with dynamic optimization problems, of which memory and random immigrants are two major schemes. This pa...
STOC
2002
ACM
16 years 2 months ago
2002
ACM
STOC
2002
ACM
16 years 2 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
119
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...