Sciweavers

523 search results - page 100 / 105
» Structured Solution Methods for Non-Markovian Decision Proce...
Sort
View
IJWIS
2008
107views more  IJWIS 2008»
14 years 11 months ago
Adaptive ontology re-use: finding and re-using sub-ontologies
Purpose The discovery of the "right" ontology or ontology part is a central ingredient for effective ontology re-use. We present an approach for supporting a form of ada...
Rodolfo Stecher, Claudia Niederée, Wolfgang...
ATAL
2006
Springer
15 years 3 months ago
Integrating parallel interactions into cooperative search
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
Efrat Manisterski, David Sarne, Sarit Kraus
CEC
2007
IEEE
15 years 3 months ago
Mining association rules from databases with continuous attributes using genetic network programming
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...
Karla Taboada, Eloy Gonzales, Kaoru Shimada, Shing...
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
15 years 6 months ago
A stopping criterion based on Kalman estimation techniques with several progress indicators
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
José Luis Guerrero, Jesús Garc&iacut...
CORR
2006
Springer
153views Education» more  CORR 2006»
14 years 11 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...