Results 131 to 140 of about 715 (165)

A Hyperheuristic Approach for Constraint Solving

2010 IEEE Electronics, Robotics and Automotive Mechanics Conference, 2010
In this work we propose a Choice Function for guiding Constraint Programming in the resolution of Constraint Satisfaction Problems. We exploit some search process features to select on the fly the Enumeration Strategy (Variable + Value Selection Heuristics) in order to more efficiently solve the problem at hand. The main novelty of our approach is that
Broderick Crawford, Carlos Castro, Eric Monfroy   +2 more
openaire   +1 more source

An ant colony hyperheuristic approach for matrix bandwidth reduction

Applied Soft Computing, 2020
Abstract This paper considers the bandwidth reduction problem for large-scale matrices in serial computations. A heuristic for bandwidth reduction reorders the rows and columns of a given sparse matrix so that the method places entries with a nonzero value as close to the main diagonal as possible.
Sanderson L. Gonzaga de Oliveira, Libério Martins Silva   +1 more
openaire   +2 more sources

Parallel Hyperheuristics for the Antenna Positioning Problem

2010
Antenna Positioning Problem (app) is an NP-Complete Optimisation Problem which arises in the telecommunication field. It consists in identifying the infrastructures required to establish a wireless network. Several objectives must be considered when tackling app and multi-objective evolutionary algorithms have been successfully applied to solve it ...
Carlos Segura, Yanira González, Gara Miranda, Coromoto León   +3 more
openaire   +1 more source

Google challenge: A hyperheuristic for the Machine Reassignment problem

2015 IEEE Congress on Evolutionary Computation (CEC), 2015
In this work we present a hyperheuristic based method to solve Google Machine Reassignment problem (MRP). MRP was proposed at ROADEF/EURO challenge 2012 competition. It is a NP-complete problem. In the competition, this hard constrained optimization problem must be solved within 5 minutes.
Rodolfo Hoffmann, María Cristina Riff, Elizabeth Montero, Nicolás Rojas 0001   +3 more
openaire   +1 more source

Concrete hyperheuristic framework for test case prioritization

Journal of Software: Evolution and Process, 2018
AbstractTest case prioritization (TCP), which aims to find the optimal test case execution sequences for specific testing objects, has been widely used in regression testing. A wide variety of search methodologies and algorithms have been proposed to optimize test case execution sequences, namely, search‐based TCP. However, different algorithms perform
Yi Bian, Zheng Li 0002, Junxia Guo, Ruilian Zhao   +3 more
openaire   +1 more source

Hyperheuristic Observation Based Slicing of Guava

2017
Observation Based Slicing is a program slicing technique that depends purely on the observation of dynamic program behaviours. It iteratively applies a deletion operator to the source code, and accepts the deletion (i.e. slices the program) if the program is observed to behave in the same was as the original with respect to the slicing criterion. While
Seongmin Lee 0001, Shin Yoo
openaire   +1 more source

Fuzzy Hyperheuristic Framework for GA Parameters Tuning

2013 12th Mexican International Conference on Artificial Intelligence, 2013
A fuzzy based hyperheuristic system is used for Genetic Algorithm self adaption. A fuzzy Takagi-Sugeno Inference System is used as High level Heuristic and the GA is used as Low-level heuristic. The framework allows to the system to automatically adjust their own parameters without the need for manual adjustment.
Fernando Gudiño-Peñaloza, Miguel González-Mendoza 0001, Jaime Mora-Vargas, Neil Hernández-Gress   +3 more
openaire   +1 more source

Cost-Benefit Investigation of a Genetic-Programming Hyperheuristic

2008
In previous work, we have introduced an effective, grammar-based, linear Genetic-Programming hyperheuristic, i.e., a search heuristicon the space of heuristics. Here we further investigate this approach inthe context of search performance and resource utilisation.
Robert E. Keller, Riccardo Poli
openaire   +1 more source

A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving

2013
In this paper we design and evaluate a dynamic selection mechanism of enumeration strategies based on the information of the solving process. Unlike previous research works we focus in reacting on the fly, allowing an early replacement of bad-performance strategies without waiting the entire solution process or an exhaustive analysis of a given class ...
Broderick Crawford, Carlos Castro 0001, Éric Monfroy, Ricardo Soto 0001, Wenceslao Palma, Fernando Paredes   +5 more
openaire   +2 more sources

MYNDA: An IDSS generator with hyperheuristic attribute reduction

Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, 2011
Development of a knowledge-based application is always hindered by the knowledge acquisition bottleneck. A knowledge-based application relies on a discovered knowledge to support the process of decision making. The knowledge model is not meaningful to the end user without the development of the DSS application of the knowledge model. MYNDA is developed
openaire   +1 more source