529 search results - page 52 / 106 » A framework for the description of evolutionary algorithms |
160
Voted
ACST
2006
15 years 4 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
134
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
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 ...
128
Voted
ICDAR
2007
IEEE
15 years 7 months ago
2007
IEEE
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 ...
150
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
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...
117
Voted
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
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...