Sciweavers

1101 search results - page 45 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
78
Voted
ICANN
2009
Springer
15 years 2 months ago
Computing with Probabilistic Cellular Automata
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
Martin Schüle, Thomas Ott, Ruedi Stoop
80
Voted
CSC
2006
14 years 11 months ago
Parallel Load Balancing Heuristics for Radiative Heat Transfer Calculations
The computation of radiative effects by the Photon Monte Carlo method is computationally demanding, especially when complex, nongray absorption models are employed. To solve such c...
Kamal Viswanath, Ivana Veljkovic, Paul E. Plassman...
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 4 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
GECCO
2006
Springer
178views Optimization» more  GECCO 2006»
15 years 1 months ago
A dynamic approach to artificial immune systems utilizing neural networks
The purpose of this work is to propose an immune-inspired setup to use a self-organizing map as a computational model for the interaction of antigens and antibodies. The proposed ...
Stefan Schadwinkel, Werner Dilger
ECP
1997
Springer
130views Robotics» more  ECP 1997»
15 years 1 months ago
Encoding Planning Problems in Nonmonotonic Logic Programs
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
Yannis Dimopoulos, Bernhard Nebel, Jana Koehler