Sciweavers

6894 search results - page 289 / 1379
» Generation Problems
Sort
View
IPPS
2007
IEEE
16 years 29 days ago
Experience of Optimizing FFT on Intel Architectures
Automatic library generators, such as ATLAS [11], Spiral [8] and FFTW [2], are promising technologies to generate efficient code for different computer architectures. The library...
Daniel Orozco, Liping Xue, Murat Bolat, Xiaoming L...
WSC
2007
15 years 9 months ago
Hierarchical planning and multi-level scheduling for simulation-based probabilistic risk assessment
Simulation of dynamic complex systems—specifically, those comprised of large numbers of components with stochastic behaviors—for the purpose of probabilistic risk assessment f...
Hamed Nejad, Dongfeng Zhu, Ali Mosleh
EUROGP
2009
Springer
138views Optimization» more  EUROGP 2009»
16 years 1 months ago
Self Modifying Cartesian Genetic Programming: Fibonacci, Squares, Regression and Summing
Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It is able to modify its own phenotype during execution of the evolved program. This is do...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
AIIA
2007
Springer
16 years 25 days ago
Towards Automated Game Design
Abstract. Game generation systems perform automated, intelligent design of games (i.e. videogames, boardgames), reasoning about both the rule system of the game and the visual real...
Mark J. Nelson, Michael Mateas
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 6 months ago
Convex Relaxations for Subset Selection
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
Francis Bach, Selin Damla Ahipasaoglu, Alexandre d...