38 search results - page 3 / 8 » A simple heuristic based genetic algorithm for the maximum c... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Based on speculations coming from statistical mechanics and the conjectured existence of critical states, I propose a simple heuristic in order to control the mutation probability...
CP
2006
Springer
13 years 9 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
COR
2011
13 years 11 days ago
2011
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job diļ¬...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
āThe Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
IWANN
2009
Springer
13 years 12 months ago
2009
Springer
Generating test data for formal state based speciļ¬cations is computationally expensive. This paper improves a framework that addresses this issue by representing the test data ge...