Sciweavers

699 search results - page 118 / 140
» A new representation in evolutionary algorithms for the opti...
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
ATAL
2006
Springer
13 years 11 months ago
A hierarchical approach to efficient reinforcement learning in deterministic domains
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
Carlos Diuk, Alexander L. Strehl, Michael L. Littm...
ECAI
2006
Springer
13 years 11 months ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
13 years 11 months ago
Smart crossover operator with multiple parents for a Pittsburgh learning classifier system
This paper proposes a new smart crossover operator for a Pittsburgh Learning Classifier System. This operator, unlike other recent LCS approaches of smart recombination, does not ...
Jaume Bacardit, Natalio Krasnogor
TCAD
2008
99views more  TCAD 2008»
13 years 7 months ago
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs
In this paper, we present a new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rate...
Tung-Chieh Chen, Ping-Hung Yuh, Yao-Wen Chang, Few...