Sciweavers

1063 search results - page 116 / 213
» Combining Simple Models to Approximate Complex Dynamics
Sort
View
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
15 years 3 months ago
Investigating the success of spatial coevolution
We investigate the results of coevolution of spatially distributed populations. In particular, we describe work in which a simple function approximation problem is used to compare...
Nathan Williams, Melanie Mitchell
CORR
2010
Springer
253views Education» more  CORR 2010»
14 years 10 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
KES
1999
Springer
15 years 2 months ago
Dynamic Demes parallel genetic algorithm
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...
Mariusz Nowostawski, Riccardo Poli
ANSOFT
2002
171views more  ANSOFT 2002»
14 years 9 months ago
OPM/Web - Object-Process Methodology for Developing Web Applications
Web applications can be classified as hybrids between hypermedia and information systems. They have a relatively simple distributed architecture from the user viewpoint, but a comp...
Iris Reinhartz-Berger, Dov Dori, Shmuel Katz
AIPS
2010
15 years 9 days ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill