Sciweavers

Share
ML
2008
ACM
8 years 4 months ago
Layered critical values: a powerful direct-adjustment approach to discovering significant patterns
Standard pattern discovery techniques, such as association rules, suffer an extreme risk of finding very large numbers of spurious patterns for many knowledge discovery tasks. The...
Geoffrey I. Webb
DAM
2008
115views more  DAM 2008»
8 years 4 months ago
Variable space search for graph coloring
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey
CORR
2008
Springer
121views Education» more  CORR 2008»
8 years 4 months ago
On the Application of Hierarchical Coevolutionary Genetic Algorithms: Recombination and Evaluation Partners
This paper examines the use of a hierarchical coevolutionary genetic algorithm under different partnering strategies. Cascading clusters of sub-populations are built from the bott...
Uwe Aickelin, Larry Bull
CORR
2008
Springer
99views Education» more  CORR 2008»
8 years 4 months ago
Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary Algorithm
This paper combines the idea of a hierarchical distributed genetic algorithm with different interagent partnering strategies. Cascading clusters of sub-populations are built from ...
Uwe Aickelin, Larry Bull
CORR
2010
Springer
117views Education» more  CORR 2010»
8 years 4 months ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou
COR
2010
146views more  COR 2010»
8 years 4 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
AROBOTS
2008
105views more  AROBOTS 2008»
8 years 4 months ago
Dynamic space reconfiguration for Bayesian search and tracking with moving targets
This paper presents a technique for dynamically reconfiguring search spaces in order to enable Bayesian autonomous search and tracking missions with moving targets. In particular, ...
Benjamin Lavis, Tomonari Furukawa, Hugh F. Durrant...
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
8 years 5 months ago
Adaptive discretization on multidimensional continuous search spaces
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
Jiun-Jiue Liou, Ying-Ping Chen
GECCO
2008
Springer
117views Optimization» more  GECCO 2008»
8 years 5 months ago
Non-monotone differential evolution
The Differential Evolution algorithm uses an elitist selection, constantly pushing the population in a strict downhill search, in an attempt to guarantee the conservation of the ...
Michael G. Epitropakis, Vassilis P. Plagianakos, M...
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
8 years 5 months ago
Search space reduction technique for constrained optimization with tiny feasible space
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
Abu S. S. M. Barkat Ullah, Ruhul A. Sarker, David ...
books