7930 search results - page 234 / 1586 » Greedy in Approximation Algorithms |
264
click to vote
IJIT
2004
15 years 8 months ago
2004
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
170
click to vote
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
171
click to vote
DEBU
2000
15 years 6 months ago
2000
Detecting database records that are approximate duplicates, but not exact duplicates, is an important task. Databases may contain duplicate records concerning the same real-world ...
169
click to vote
RECOMB
2007
Springer
16 years 6 months ago
2007
Springer
Accurately reconstructing the large-scale gene order in an ancestral genome is a critical step to better understand genome evolution. In this paper, we propose a heuristic algorith...
169
click to vote
ICIAP
2001
Springer
16 years 6 months ago
2001
Springer
Deformable models are by their formulation able to solve surface extraction problem from noisy volumetric image data encountered commonly in medical image analysis. However, this ...