288 search results - page 45 / 58 » Gene Identification: Classical and Computational Intelligenc... |
AIPS
2006
13 years 10 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
TAL
2004
Springer
14 years 2 months ago
2004
Springer
Word fragments or n-grams have been widely used to perform different Natural Language Processing tasks such as information retrieval [1] [2], document categorization [3], automatic...
GECCO
2003
Springer
14 years 2 months ago
2003
Springer
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
CAEPIA
2005
Springer
14 years 2 months ago
2005
Springer
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
KI
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We compare three systems for the task of synthesising functional recursive programs, namely Adate, an approach through evolutionary computation, the classification learn...