Sciweavers

1310 search results - page 185 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
CCGRID
2010
IEEE
13 years 10 months ago
Asynchronous Communication Schemes for Finite Difference Methods on Multiple GPUs
Finite difference methods continue to provide an important and parallelisable approach to many numerical simulations problems. Iterative multigrid and multilevel algorithms can co...
Daniel P. Playne, Kenneth A. Hawick
GECCO
2005
Springer
203views Optimization» more  GECCO 2005»
14 years 2 months ago
Ant colony optimization for power plant maintenance scheduling optimization
In order to maintain a reliable and economic electric power supply, the maintenance of power plants is becoming increasingly important. In this paper, a formulation that enables a...
Wai-Kuan Foong, Holger R. Maier, Angus R. Simpson
AAAI
2010
13 years 10 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
EAAI
2006
189views more  EAAI 2006»
13 years 8 months ago
Evolutionary algorithms for VLSI multi-objective netlist partitioning
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
Sadiq M. Sait, Aiman H. El-Maleh, Raslan H. Al-Aba...
SODA
1990
ACM
114views Algorithms» more  SODA 1990»
13 years 10 months ago
Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki