3433 search results - page 173 / 687 » Heuristics for a bidding problem |
208
click to vote
NC
2002
15 years 6 months ago
2002
This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detectin...
158
click to vote
IJAIT
2010
15 years 5 months ago
2010
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
155
click to vote
EMMCVPR
2009
Springer
16 years 1 months ago
2009
Springer
We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...
150
click to vote
GECCO
2007
Springer
16 years 22 days ago
2007
Springer
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
183
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...