Sciweavers

2254 search results - page 389 / 451
» Computing the minimal covering set
Sort
View
EOR
2006
73views more  EOR 2006»
13 years 10 months ago
Path relinking and GRG for artificial neural networks
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
Abdellah El-Fallahi, Rafael Martí, Leon S. ...
IJHPCA
2006
125views more  IJHPCA 2006»
13 years 10 months ago
Complexity Results for Collective Communications on Heterogeneous Platforms
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
Olivier Beaumont, Loris Marchal, Yves Robert
EOR
2007
96views more  EOR 2007»
13 years 10 months ago
A balancing method and genetic algorithm for disassembly line balancing
Disassembly activities take place in various recovery operations including remanufacturing, recycling and disposal. The disassembly line is the best choice for automated disassemb...
Seamus M. McGovern, Surendra M. Gupta
EOR
2007
78views more  EOR 2007»
13 years 10 months ago
A heuristic for the three-dimensional strip packing problem
The contribution presents a heuristic for the three-dimensional strip packing problem (3D-SPP) with rectangular pieces (boxes). The considered 3D-SPP can be formulated as follows:...
Andreas Bortfeldt, Daniel Mack
MCS
2006
Springer
13 years 10 months ago
On the advantages of non-cooperative behavior in agent populations
We investigate the amount of cooperation between agents in a population during reward collection that is required to minimize the overall collection time. In our computer simulati...
Alexander Pudmenzky