5316 search results - page 159 / 1064 » Which Search Problems Are Random |
161
Voted
AIPS
2008
15 years 6 months ago
2008
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
115
Voted
TACAS
2010
Springer
15 years 8 months ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
127
Voted
CCCG
2003
15 years 5 months ago
2003
We consider the problem of finding the shortest curve in the plane that has unit width. This problem was first posed as the “river shore” puzzle by Ogilvy (1972) and is rela...
120
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and ...
110
click to vote
CSC
2006
15 years 5 months ago
2006
Abstract: Tikhonov regularization is a popular and effective method for the approximate solution of illposed problems, including Fredholm equations of the first kind. The Tikhonov ...