Sciweavers

5595 search results - page 337 / 1119
» Comparing Subsumption Optimizations
Sort
View
GECCO
2005
Springer
197views Optimization» more  GECCO 2005»
16 years 7 days ago
Breeding swarms: a GA/PSO hybrid
Abstract. In this paper we propose a novel hybrid (GA/PSO) algorithm, Breeding Swarm, combining the strengths of particle swarm optimization with genetic algorithms. The hybrid alg...
Matthew Settles, Terence Soule
ASPDAC
2004
ACM
129views Hardware» more  ASPDAC 2004»
16 years 5 days ago
Instruction buffering exploration for low energy VLIWs with instruction clusters
— For multimedia applications, loop buffering is an efficient mechanism to reduce the power in the instruction memory of embedded processors. In particular, software controlled ...
Tom Vander Aa, Murali Jayapala, Francisco Barat, G...
ATAL
2004
Springer
16 years 4 days ago
Adaptive, Distributed Control of Constrained Multi-Agent Systems
Product Distribution (PD) theory was recently developed as a framework for analyzing and optimizing distributed systems. In this paper we demonstrate its use for adaptive distribu...
Stefan Bieniawski, David Wolpert
ICANN
2003
Springer
15 years 12 months ago
Sparse Coding with Invariance Constraints
We suggest a new approach to optimize the learning of sparse features under the constraints of explicit transformation symmetries imposed on the set of feature vectors. Given a set...
Heiko Wersing, Julian Eggert, Edgar Körner
PAAMS
2010
Springer
15 years 11 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier