Sciweavers

1871 search results - page 263 / 375
» Selecting for evolvable representations
Sort
View
AAAI
2008
13 years 10 months ago
Incremental Algorithms for Approximate Compilation
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
Alberto Venturini, Gregory M. Provan
AAAI
2007
13 years 10 months ago
A Modular Action Description Language for Protocol Composition
Protocols are modular abstractions that capture patterns of interaction among agents. The compelling vision behind protocols is to enable creating customized interactions by refi...
Nirmit Desai, Munindar P. Singh
EMO
2006
Springer
120views Optimization» more  EMO 2006»
13 years 9 months ago
Rule Induction for Classification Using Multi-objective Genetic Programming
Multi-objective metaheuristics have previously been applied to partial classification, where the objective is to produce simple, easy to understand rules that describe subsets of a...
Alan P. Reynolds, Beatriz de la Iglesia
ACL
2008
13 years 9 months ago
Unsupervised Discovery of Generic Relationships Using Pattern Clusters and its Evaluation by Automatically Generated SAT Analogy
We present a novel framework for the discovery and representation of general semantic relationships that hold between lexical items. We propose that each such relationship can be ...
Dmitry Davidov, Ari Rappoport
AIA
2007
13 years 9 months ago
Adaptive preference elicitation for top-K recommendation tasks using GAI-networks
The enormous number of questions needed to acquire a full preference model when the size of the outcome space is large forces us to work with partial models that approximate the u...
Sérgio R. de M. Queiroz