Sciweavers

529 search results - page 52 / 106
» A framework for the description of evolutionary algorithms
Sort
View
ACST
2006
13 years 9 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara
ICALP
2007
Springer
14 years 1 months ago
Modular Algorithms for Heterogeneous Modal Logics
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
Lutz Schröder, Dirk Pattinson
ICDAR
2007
IEEE
13 years 11 months ago
An Incremental On-line Parsing Algorithm for Recognizing Sketching Diagrams
This paper presents a syntactic recognition approach for on-line drawn graphical symbols. The proposed method consists in an incremental on-line predictive parser based on symbol ...
Joan Mas, Gemma Sánchez, Josep Lladó...
ICASSP
2011
IEEE
12 years 11 months ago
Sparse coding and dictionary learning based on the MDL principle
The power of sparse signal coding with learned overcomplete dictionaries has been demonstrated in a variety of applications and fields, from signal processing to statistical infe...
Ignacio Ramírez, Guillermo Sapiro
EVOW
2006
Springer
13 years 11 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...