Sciweavers

526 search results - page 56 / 106
» Generalized benchmark generation for dynamic combinatorial p...
Sort
View
CEC
2010
IEEE
14 years 11 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius
CGO
2010
IEEE
15 years 4 months ago
Parameterized tiling revisited
Tiling, a key transformation for optimizing programs, has been widely studied in literature. Parameterized tiled code is important for auto-tuning systems since they often execute...
Muthu Manikandan Baskaran, Albert Hartono, Sanket ...
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
15 years 1 months ago
Efficient and robust communication topologies for distributed decision making in networked systems
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
John S. Baras, Pedram Hovareshti
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
15 years 3 months ago
Resource-limited genetic programming: the dynamic approach
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
Sara Silva, Ernesto Costa
CRV
2008
IEEE
295views Robotics» more  CRV 2008»
15 years 4 months ago
3D Human Motion Tracking Using Dynamic Probabilistic Latent Semantic Analysis
We propose a generative statistical approach to human motion modeling and tracking that utilizes probabilistic latent semantic (PLSA) models to describe the mapping of image featu...
Kooksang Moon, Vladimir Pavlovic