101 search results - page 16 / 21 » Solving Combinatorial Auctions Using Stochastic Local Search |
152
Voted
GECCO
2007
Springer
15 years 12 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
174
Voted
CIKM
1998
Springer
15 years 10 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
165
Voted
OL
2007
15 years 5 months ago
2007
We introduce a novel global optimization method called Continuous GRASP (C-GRASP) which extends Feo and Resende’s greedy randomized adaptive search procedure (GRASP) from the dom...
208
Voted
EVOW
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
190
Voted
ECP
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...