Search results for "problem difficulty"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Martin Pelikan	NK landscapes, problem difficulty, and hybrid evolutionary algorithms.	GECCO	2010	DBLP DOI BibTeX RDF	correlation length, escape rate, fitness distance correlation, hboa, performance analysis, estimation of distribution algorithms, hierarchical boa, problem difficulty, hybrid evolutionary algorithms, nk fitness landscape
3	Steven Gustafson, Anikó Ekárt, Edmund K. Burke, Graham Kendall	Problem Difficulty and Code Growth in Genetic Programming.	Genetic Programming and Evolvable Machines	2004	DBLP DOI BibTeX RDF	genetic programming, problem difficulty, population diversity, code growth
2	Leonardo Vanneschi	Fitness landscapes and problem hardness in genetic programming.	GECCO (Companion)	2010	DBLP DOI BibTeX RDF	genetic programming, fitness landscapes, problem difficulty
2	Bin Xin, Jie Chen 0003, Feng Pan	Problem difficulty analysis for particle swarm optimization: deception and modality.	GEC Summit	2009	DBLP DOI BibTeX RDF	particle swarm optimization, global optimization, problem hardness
2	Sung-Soon Choi, Yung-Keun Kwon, Byung Ro Moon	Properties of symmetric fitness functions.	GECCO	2006	DBLP DOI BibTeX RDF	Walsh analysis, problem difficulty measures, search space analysis, symmetric fitness functions, encoding scheme
2	Jason M. Daida	Towards identifying populations that increase the likelihood of success in genetic programming.	GECCO	2005	DBLP DOI BibTeX RDF	binomial-3, GP problem difficulty, building blocks, population dynamics, selection methods, initial populations
2	Karsten Weicker	Problem Difficulty in Real-Valued Dynamic Problems.	Fuzzy Days	2001	DBLP DOI BibTeX RDF
1	Benjamin V. Hanrahan, Gregorio Convertino, Les Nelson	Modeling problem difficulty and expertise in stackoverflow.	CSCW (Companion)	2012	DBLP DOI BibTeX RDF
1	Edgar Galván López, James McDermott, Michael O'Neill, Anthony Brabazon	Defining locality as a problem difficulty measure in genetic programming.	Genetic Programming and Evolvable Machines	2011	DBLP DOI BibTeX RDF
1	Adele E. Howe, Jean-Paul Watson, L. Darrell Whitley	Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search	CoRR	2011	DBLP BibTeX RDF
1	Mark Hauschild, Martin Pelikan	Advanced neighborhoods and problem difficulty measures.	GECCO	2011	DBLP DOI BibTeX RDF
1	Leonardo Trujillo, Yuliana Martínez, Edgar Galván López, Pierrick Legrand	Predicting problem difficulty for genetic programming applied to data classification.	GECCO	2011	DBLP DOI BibTeX RDF
1	Mario Graff, Riccardo Poli	Performance Models for Evolutionary Program Induction Algorithms Based on Problem Difficulty Indicators.	EuroGP	2011	DBLP DOI BibTeX RDF
1	Juan Arturo Herrera Ortiz, Carlos Oliver-Morales, Katya Rodríguez-Vázquez	Amount and type of information: a GA-hardness taxonomy.	GECCO	2010	DBLP DOI BibTeX RDF	evolutionary algorithms, problem difficulty
1	Michael D. Schmidt, Hod Lipson	Age-fitness pareto optimization.	GECCO	2010	DBLP DOI BibTeX RDF	evolutionary algorithms, age, symbolic regression, pareto
1	Martin Pelikan, Kumara Sastry, David E. Goldberg, Martin V. Butz, Mark Hauschild	Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap.	GECCO	2009	DBLP DOI BibTeX RDF	hboa, genetic algorithm, scalability, performance analysis, hybridization, crossover, fitness landscape, hierarchical boa, problem difficulty, nk fitness landscape
1	Leonardo Vanneschi, Andrea Valsecchi, Riccardo Poli	Limitations of the fitness-proportional negative slope coefficient as a difficulty measure.	GECCO	2009	DBLP DOI BibTeX RDF	fitness clouds, fitness-proportional negative slope coefficient, fitness landscapes, problem difficulty
1	Matthias J. Linhardt, Martin V. Butz	NEAT in increasingly non-linear control situations.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	adaptive control, neuroevolution, neat, dynamic control
1	Patrick O. Stalph, Martin V. Butz, David E. Goldberg, Xavier Llorà	On the scalability of XCS(F).	GECCO	2009	DBLP DOI BibTeX RDF	lwpr, learning classifier systems, xcs, function approximation, recursive least squares
1	Leonardo Vanneschi	Fitness landscapes and problem hardness in genetic programming.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	genetic programming, fitness landscapes, problem hardness
1	Enda Ridge, Daniel Kudenko	Determining Whether a Problem Characteristic Affects Heuristic Performance.	Recent Advances in Evolutionary Computation for Combinatorial Optimization	2008	DBLP DOI BibTeX RDF	Nest Hierarchical Design, Design of Experiments, Ant Colony Optimisation, Problem Difficulty
1	Yossi Borenstein	An information perspective on evolutionary computation.	GECCO (Companion)	2008	DBLP DOI BibTeX RDF	information theory, kolmogorov complexity, randomized search heuristics
1	Patrick O. Stalph, Martin V. Butz	Towards increasing learning speed and robustness of XCSF: experimenting with larger offspring set sizes.	GECCO (Companion)	2008	DBLP DOI BibTeX RDF	reproduction, learning classifier systems, selection pressure, XCSF
1	Marco Tomassini, Leonardo Vanneschi	Negative Slope Coefficient and the Difficulty of Random 3-SAT Instances.	EvoWorkshops	2008	DBLP DOI BibTeX RDF
1	Érick Alphonse, Aomar Osmani	On the connection between the phase transition of the covering test and the learning success rate in ILP.	Machine Learning	2008	DBLP DOI BibTeX RDF	Plateau phenomena, Near-miss examples, Heuristic search, Inductive logic programming, Phase transition
1	Jun He, Colin R. Reeves, Carsten Witt, Xin Yao	A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability.	Evolutionary Computation	2007	DBLP DOI BibTeX RDF
1	Enda Ridge, Daniel Kudenko	An Analysis of Problem Difficulty for a Class of Optimisation Heuristics.	EvoCOP	2007	DBLP DOI BibTeX RDF
1	Ildikó Pelczer, Fernando Gamboa Rodríguez	Automated Assessment of Problem Difficulty in Mathematical Analysis.	AIED	2007	DBLP BibTeX RDF
1	Riccardo Poli, Leonardo Vanneschi	Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms.	GECCO	2007	DBLP DOI BibTeX RDF	negative slope coefficient, theory, problem difficulty
1	Kumara Sastry, Martin Pelikan, David E. Goldberg	Empirical analysis of ideal recombination on random decomposable problems.	GECCO	2007	DBLP DOI BibTeX RDF	additively-decomposable problems, ideal crossover, genetic algorithms, building blocks, empirical analysis, population sizing, convergence time, problem difficulty, test problems, scalability analysis
1	Yossi Borenstein	An information perspective on evolutionary computation.	GECCO (Companion)	2007	DBLP DOI BibTeX RDF	evolutionary computation, theory, Kolmogorov complexity
1	Peter A. N. Bosman, Han La Poutré	Learning and anticipation in online dynamic optimization with evolutionary algorithms: the stochastic case.	GECCO	2007	DBLP DOI BibTeX RDF	evolutionary algorithms, dynamic optimization, stochastic optimization, anticipation, online optimization
1	Peter A. N. Bosman, Han La Poutré	Inventory management and the impact of anticipation in evolutionary stochastic online dynamic optimization.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
1	José Salvador Sánchez, Ramón Alberto Mollineda, José Martínez Sotoca	An analysis of how training data complexity affects the nearest neighbor classifiers.	Pattern Anal. Appl.	2007	DBLP DOI BibTeX RDF
1	Tuan Hao Hoang, Nguyen Xuan Hoai, Nguyen Thi Hien, Robert I. McKay, Daryl Essam	ORDERTREE: a new test problem for genetic programming.	GECCO	2006	DBLP DOI BibTeX RDF	benchmark problems, genetic programming, problem difficulty
1	Alan Piszcz, Terence Soule	Genetic programming: optimal population sizes for varying complexity problems.	GECCO	2006	DBLP DOI BibTeX RDF	MAX binary tree problem, binomial-3, optimal, population sizing, problem difficulty
1	Paul Winward, David E. Goldberg	Fluctuating crosstalk, deterministic noise, and GA scalability.	GECCO	2006	DBLP DOI BibTeX RDF	deterministic noise, fluctuating crosstalk, genetic algorithm, scalability, problem difficulty
1	Yossi Borenstein, Riccardo Poli	Information Perspective of Optimization.	PPSN	2006	DBLP DOI BibTeX RDF
1	Martin Pelikan, Kumara Sastry, Martin V. Butz, David E. Goldberg	Performance of Evolutionary Algorithms on Random Decomposable Problems.	PPSN	2006	DBLP DOI BibTeX RDF
1	Jean-Paul Watson, L. Darrell Whitley, Adele E. Howe	Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search.	J. Artif. Intell. Res. (JAIR)	2005	DBLP DOI BibTeX RDF
1	Leonardo Vanneschi, Marco Tomassini, Philippe Collard, Manuel Clergue	A Survey of Problem Difficulty in Genetic Programming.	AI*IA	2005	DBLP DOI BibTeX RDF
1	Javed I. Khan, Manas Hardas, Yongbin Ma	A Study of Problem Difficulty Evaluation for Semantic Network Ontology Based Intelligent Courseware Sharing.	Web Intelligence	2005	DBLP DOI BibTeX RDF	test-ware digital library, semantic web, automatic composition
1	Peter A. N. Bosman	Learning, anticipation and time-deception in evolutionary online dynamic optimization.	GECCO Workshops	2005	DBLP DOI BibTeX RDF	learning, evolutionary algorithms, predicting, dynamic optimization, online optimization
1	Yong-Hyuk Kim, Byung Ro Moon	New topologies for genetic search space.	GECCO	2005	DBLP DOI BibTeX RDF	distance mesaure, genetic algorithms
1	Cláudio F. Lima, Kumara Sastry, David E. Goldberg, Fernando G. Lobo	Combining competent crossover and mutation operators: a probabilistic model building approach.	GECCO	2005	DBLP DOI BibTeX RDF	BB-wise mutation, competent genetic algorithms, hybridization, probabilistic model building genetic algorithms
1	Steven M. Gustafson, Leonardo Vanneschi	Operator-Based Distance for Genetic Programming: Subtree Crossover Distance.	EuroGP	2005	DBLP DOI BibTeX RDF
1	Ada M. Alvarez, José Luis González Velarde, Karim De-Alba	Grasp Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem.	J. Heuristics	2005	DBLP DOI BibTeX RDF	Scater Search, network design, GRASP
1	Jano I. van Hemert, Thomas Bäck	Robust Parameter Settings for Variation Operators by Measuring the Resampling Ratio: A Study on Binary Constraint Satisfaction Problems.	J. Heuristics	2004	DBLP DOI BibTeX RDF	binary constraint satisfaction, variation operators, resampling ratio, searched space, problem difficulty
1	Yossi Borenstein, Riccardo Poli	Fitness Distributions and GA Hardness.	PPSN	2004	DBLP DOI BibTeX RDF
1	Jean-Paul Watson, J. Christopher Beck, Adele E. Howe, L. Darrell Whitley	Problem difficulty for tabu search in job-shop scheduling.	Artif. Intell.	2003	DBLP DOI BibTeX RDF
1	Leonardo Vanneschi, Marco Tomassini, Philippe Collard, Manuel Clergue	Fitness Distance Correlation in Structural Mutation Genetic Programming.	EuroGP	2003	DBLP DOI BibTeX RDF
1	Anton V. Eremeev, Colin R. Reeves	On Confidence Intervals for the Number of Local Optima.	EvoWorkshops	2003	DBLP DOI BibTeX RDF
1	Taras P. Riopka	Adapting to Complexity During Search in Combinatorial Landscapes.	EvoWorkshops	2003	DBLP DOI BibTeX RDF
1	Franz Rothlauf	On the Locality of Representations.	GECCO	2003	DBLP DOI BibTeX RDF
1	Leonardo Vanneschi, Marco Tomassini, Manuel Clergue, Philippe Collard	Difficulty of Unimodal and Multimodal Landscapes in Genetic Programming.	GECCO	2003	DBLP DOI BibTeX RDF
1	Mariusz Rybnik, Abdennasser Chebira, Kurosh Madani	Auto-adaptive Neural Network Tree Structure Based on Complexity Estimator.	IWANN	2003	DBLP DOI BibTeX RDF	Multi-Neural Networks, Divide To Simplify, Classification, Complexity Estimation, Auto-Adaptive
1	Chang Wook Ahn, Ki Pyo Kim, Rudrapatna S. Ramakrishna	A Memory-Efficient Elitist Genetic Algorithm.	PPAM	2003	DBLP DOI BibTeX RDF
1	Manuel Clergue, Philippe Collard, Marco Tomassini, Leonardo Vanneschi	Fitness Distance Correlation And Problem Difficulty For Genetic Programming.	GECCO	2002	DBLP BibTeX RDF
1	Hyung Shin Kim, Yunju Baek, Heung-Kyu Lee, Young-Ho Suh	Robust Image Watermark Using Radon Transform and Bispectrum Invariants.	Information Hiding	2002	DBLP DOI BibTeX RDF
1	Bart Naudts, Leila Kallel	A comparison of predictive measures of problem difficulty in evolutionary algorithms.	IEEE Trans. Evolutionary Computation	2000	DBLP DOI BibTeX RDF
1	Michael Mayo, Antonija Mitrovic	Using a Probabilistic Student Model to Control Problem Difficulty.	Intelligent Tutoring Systems	2000	DBLP DOI BibTeX RDF	evaluation of instructional systems, student modeling, instructional design
1	Jason D. Lohn, Gary L. Haith, Silvano Colombano, Dimitris Stassinopoulos	A Comparison of Dynamic Fitness Schedules for Evolutionary Design of Amplifiers.	Evolvable Hardware	1999	DBLP DOI BibTeX RDF
1	Joseph E. Beck, Beverly Park Woolf	Using a Learning Agent with a Student Model.	Intelligent Tutoring Systems	1998	DBLP DOI BibTeX RDF
1	Hillol Kargupta	Signal-to-noise, Crosstalk, and Long Range Problem Difficulty in Genetic Algorithms.	ICGA	1995	DBLP BibTeX RDF
1	Terry Jones, Stephanie Forrest	Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms.	ICGA	1995	DBLP BibTeX RDF
1	Jeffrey Horn, David E. Goldberg, Kalyanmoy Deb	Long Path Problems.	PPSN	1994	DBLP DOI BibTeX RDF