376 search results - page 34 / 76 » Solution Counting Algorithms for Constraint-Centered Search ... |
INFORMATICALT
2006
14 years 9 months ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In multiobjective particle swarm optimization (MOPSO) methods, selecting the local best and the global best for each particle of the population has a great impact on the convergen...
88
Voted
CP
2009
Springer
15 years 4 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...