454 search results - page 61 / 91 » On improving approximate solutions by evolutionary algorithm... |
122
click to vote
ICTAI
2010
IEEE
14 years 11 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
This paper describes a novel algorithm for the efficient synthesis of high-quality virtual views from only two input images. The emphasis is on the recovery of continuity of objec...
140
click to vote
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
117
click to vote
EOR
2008
15 years 1 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
139
click to vote
DAC
2006
ACM
16 years 2 months ago
2006
ACM
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...