14704 search results - page 2606 / 2941 » computing 2007 |
132
click to vote
FSTTCS
2007
Springer
15 years 11 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
151
click to vote
FSTTCS
2007
Springer
15 years 11 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
145
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
133
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The success of evolutionary algorithms (EAs) depends crucially on finding suitable parameter settings. Doing this by hand is a very time consuming job without the guarantee to ...
147
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...