Abstract Optimisation algorithms with good anytime behaviour try to return as high-quality solutions as possible independently of the computation time allowed. Designing algorithms with good anytime behaviour is a difficult task, because performance is often evaluated subjectively, by plotting the trade-off curve between computation time and solution quality. Yet, the trade-off curve may be modelled also as a set of mutually nondominated, bi-objective points. Using this model, we propose to combine an automatic configuration tool and the hypervolume measure, which assigns a single quality measure to a nondominated set. This allows us to improve the anytime behaviour of optimisation algorithms by means of automatically finding algorithmic co...
This paper presents a set of capping methods to speed-up the automated configuration of optimization...
Anytime algorithms give intelligent real-time systems the ability to trade deliberation time for qua...
Most of the satisficing planners which are based on heuristic search iteratively improve their solut...
International audienceAnytime algorithms allow a practitioner to trade-off runtime for solution qual...
In many real world problems the quality of solutions needs to be evaluated at least according to a b...
In multiobjective optimization, the result of an optimization algorithm is a set of efficient soluti...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
International audienceAnytime algorithms for optimization problems are of particular interest since ...
AbstractAnytime algorithms offer a tradeoff between solution quality and computation time that has p...
International audienceA Branch-and-Prune algorithm computes a paving of the solution set of a numeri...
Industrial software often has many parameters that critically impact performance. Frequently, these ...
The development of algorithms for tackling continuous optimization problems has been one of the most...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
open accessInternational audienceWe present concepts and recipes for the anytime performance assessm...
Optimization underpins many of the challenges that science and technology face on a daily basis. Rec...
This paper presents a set of capping methods to speed-up the automated configuration of optimization...
Anytime algorithms give intelligent real-time systems the ability to trade deliberation time for qua...
Most of the satisficing planners which are based on heuristic search iteratively improve their solut...
International audienceAnytime algorithms allow a practitioner to trade-off runtime for solution qual...
In many real world problems the quality of solutions needs to be evaluated at least according to a b...
In multiobjective optimization, the result of an optimization algorithm is a set of efficient soluti...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
International audienceAnytime algorithms for optimization problems are of particular interest since ...
AbstractAnytime algorithms offer a tradeoff between solution quality and computation time that has p...
International audienceA Branch-and-Prune algorithm computes a paving of the solution set of a numeri...
Industrial software often has many parameters that critically impact performance. Frequently, these ...
The development of algorithms for tackling continuous optimization problems has been one of the most...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
open accessInternational audienceWe present concepts and recipes for the anytime performance assessm...
Optimization underpins many of the challenges that science and technology face on a daily basis. Rec...
This paper presents a set of capping methods to speed-up the automated configuration of optimization...
Anytime algorithms give intelligent real-time systems the ability to trade deliberation time for qua...
Most of the satisficing planners which are based on heuristic search iteratively improve their solut...