120 search results - page 17 / 24 » Genetic Programming Heuristics for Multiple Machine Scheduli... |
KES
1999
Springer
13 years 11 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
ML
1998
ACM
13 years 7 months ago
1998
ACM
Recent algorithmic and theoretical advances in reinforcement learning (RL) have attracted widespread interest. RL algorithmshave appeared that approximatedynamic programming on an ...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
PLDI
2004
ACM
14 years 27 days ago
2004
ACM
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...