8125 search results - page 61 / 1625 » Parallelism and evolutionary algorithms |
164
click to vote
TAINN
2005
Springer
15 years 8 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
102
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— In spite of large amount of research work in multiobjective evolutionary algorithms, most have evaluated their algorithms on problems with only two to four objectives. ...
88
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary...
145
Voted
EPS
1998
Springer
15 years 6 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
133
click to vote
TOCL
2008
15 years 2 months ago
2008
State Machines Capture Parallel Algorithms: Correction and Extension ANDREAS BLASS University of Michigan and YURI GUREVICH Microsoft Research We consider parallel algorithms worki...