Sciweavers

1816 search results - page 196 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
16 years 21 days ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
ICCBR
2007
Springer
16 years 21 days ago
Case-Based Reasoning Adaptation for High Dimensional Solution Space
Case-Based Reasoning (CBR) is a methodology that reuses the solutions of previous similar problems to solve new problems. Adaptation is the most difficult stage in the CBR cycle, e...
Ying Zhang, Panos Louvieris, Maria Petrou
MICAI
2004
Springer
15 years 12 months ago
Evaluation-Based Semiring Meta-constraints
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
Jerome Kelleher, Barry O'Sullivan
CINQ
2004
Springer
133views Database» more  CINQ 2004»
15 years 10 months ago
Inductive Querying for Discovering Subgroups and Clusters
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...
Albrecht Zimmermann, Luc De Raedt
EMO
2006
Springer
182views Optimization» more  EMO 2006»
15 years 10 months ago
Multi-objective Pole Placement with Evolutionary Algorithms
Multi-Objective Evolutionary Algorithms (MOEA) have been succesfully applied to solve control problems. However, many improvements are still to be accomplished. In this paper a new...
Gustavo Sánchez, Minaya Villasana, Miguel S...