4110 search results - page 151 / 822 » Efficient algorithms for the 2-gathering problem |
143
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
112
click to vote
HPCC
2007
Springer
15 years 8 months ago
2007
Springer
Effective and efficient mapping algorithms for multisite parallel applications are fundamental to exploit the potentials of grid computing. Since the problem of optimally mapping i...
111
Voted
PRL
2006
15 years 4 months ago
2006
We present a maximum a posteriori solution to the problem of obtaining a high-resolution image from a set of degraded low-resolution images of the same scene. The proposed algorit...
134
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
We describe soft versions of the global cardinality constraint and the regular constraint, with efficient filtering algorithms maintaining domain consistency. For both constraints,...
145
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...