159 search results - page 25 / 32 » Computing minimum cuts by randomized search heuristics |
101
click to vote
CCECE
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper we propose an improved motion estimation algorithm based on Evolutionary strategy (ES) for H.264 video codec applied to video. The proposed technique works in a para...
100
Voted
ACG
2009
Springer
15 years 7 months ago
2009
Springer
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, M...
102
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
102
click to vote
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
106
click to vote
GECCO
2009
Springer
15 years 7 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...