Sciweavers

1061 search results - page 30 / 213
» Natural Selection in Relation to Complexity
Sort
View
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
14 years 2 months ago
Boosting Relational Sequence Alignments
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
Andreas Karwath, Kristian Kersting, Niels Landwehr
AI
1999
Springer
13 years 7 months ago
Using Grice's maxim of Quantity to select the content of plan descriptions
Intelligent systems are often called upon to form plans that direct their own or other agents' activities. For these systems, the ability to describe plans to people in natur...
R. Michael Young
ECAI
2000
Springer
14 years 2 days ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
ACISP
2003
Springer
13 years 11 months ago
Grouping Verifiable Content for Selective Disclosure
Abstract. This paper addresses the issue of selective disclosure of verifiable content. It extends previous work relating to Content Extraction Signatures [21] to implement a more ...
Laurence Bull, David McG. Squire, Jan Newmarch, Yu...
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
13 years 11 months ago
Selecting for evolvable representations
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
Joseph Reisinger, Risto Miikkulainen