Sciweavers

146 search results - page 7 / 30
» Efficient algorithms for the block edit problems
Sort
View
EC
2006
195views ECommerce» more  EC 2006»
14 years 9 months ago
Automated Global Structure Extraction for Effective Local Building Block Processing in XCS
Learning Classifier Systems (LCSs), such as the accuracy-based XCS, evolve distributed problem solutions represented by a population of rules. During evolution, features are speci...
Martin V. Butz, Martin Pelikan, Xavier Llorà...
MASCOTS
2010
14 years 11 months ago
PUD-LRU: An Erase-Efficient Write Buffer Management Algorithm for Flash Memory SSD
Flash memory SSDs pose a well-known challenge, that is, the erase-before-write problem. Researchers try to solve this inherent problem from two different angles by either designing...
Jian Hu, Hong Jiang, Lei Tian, Lei Xu
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
15 years 1 months ago
Overcoming hierarchical difficulty by hill-climbing the building block structure
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
David Iclanzan, Dan Dumitrescu
TPDS
1998
92views more  TPDS 1998»
14 years 9 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
CPM
2006
Springer
143views Combinatorics» more  CPM 2006»
15 years 1 months ago
Algorithms for Finding a Most Similar Subforest
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
Jesper Jansson, Zeshan Peng