9842 search results - page 320 / 1969 » The Complexity of the Matching-Cut Problem |
133
click to vote
ICNC
2009
Springer
15 years 10 months ago
2009
Springer
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
126
click to vote
ICAC
2007
IEEE
15 years 10 months ago
2007
IEEE
An autonomic problem determination system can adapt to changing environments, react to existing or new error condition and predict possible problems. In this report, we propose su...
118
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
121
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
d Abstract] Mikhail Alekhnovich ∗ Subhash A. Khot † Guy Kindler ‡ Nisheeth K. Vishnoi § We show that, unless NP⊆DTIME(2poly log(n) ), the closest vector problem with pre-...
150
click to vote
ARCS
2004
Springer
15 years 9 months ago
2004
Springer
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...