5138 search results - page 342 / 1028 » Randomized Algorithms for 3-SAT |
184
click to vote
JDCTA
2010
15 years 1 months ago
2010
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
175
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
168
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
181
click to vote
WOSP
2005
ACM
16 years 6 days ago
2005
ACM
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
148
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...