442 search results - page 55 / 89 » Discovering Heuristic Strategy for Solving Scheduling Proble... |
134
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
144
Voted
ARC
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Few of the benefits of exploiting partially reconfigurable devices are power consumption reduction, cost reduction, and customized performance improvement. To obtain thes...
146
Voted
FLAIRS
2007
15 years 6 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
141
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
s the Pus using the OpenCL API as the platform independent programming model. It has the proposal to extend OpenCL with a module that schedule and balance the workload over the CPU...
135
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly a...