2796 search results - page 117 / 560 » The coolest path problem |
167
click to vote
TPDS
2002
15 years 4 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
152
click to vote
SAC
2005
ACM
15 years 10 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
126
click to vote
IPL
2002
15 years 4 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
141
click to vote
PPSN
2004
Springer
15 years 10 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
244
Voted
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...