In application fields such as linguistic and computer vision there is an increasing need of reference data for the empirical analysis of new methods and the assessment of different algorithms. Current evaluations are based on few real-life collections or on artificial data generators built on models that are too simplistic to cover real scenarios and to allow researchers to identify crucial limitations of their algorithms. We propose a flexible approach to generate high-dimensional vectors, with directional properties controlled by the distribution of their pair-wise cosine distances. The generation method is formulated as a non-linear continuous optimization problem, which is solved with a computationally efficient local search algorithm. ...
The purpose of this paper is twofold: first, to introduce deterministic strategies for directional d...
This paper introduces a new algorithmic technique for solving certain problems in geometric computer...
[If=2.358]International audienceThis paper presents a new local search approach for solving continuo...
A number of artificial intelligence and machine learning problems need to be formulated within a dir...
This paper focuses on a subclass of box-constrained, non-linear optimization problems. We are partic...
peer reviewedOver the years, many optimization algorithms have been developed to solve large-scale o...
Proceeding of: 10th International Conference, IDEAL 2009, Burgos, Spain, September 23-26, 2009Many c...
Proceeding of: Ninth International Conference on Intelligent Systems Design and Applications, 2009. ...
This book covers local search for combinatorial optimization and its extension to mixed-variable opt...
The problem of dividing a sequence of values into segments occurs in database systems, information r...
AbstractThis paper introduces multi-directional local search, a metaheuristic for multi-objective op...
We present and evaluate a specific way to generate good start solutions for local search. The start ...
We present new techniques to analyze natural local search algorithms for several variants of the max...
Locating and identifying points as global minimizers is, in general, a hard and time-consuming task....
This paper proposes a Parallel Guided Local Search (PGLS) framework for continuous optimization. In ...
The purpose of this paper is twofold: first, to introduce deterministic strategies for directional d...
This paper introduces a new algorithmic technique for solving certain problems in geometric computer...
[If=2.358]International audienceThis paper presents a new local search approach for solving continuo...
A number of artificial intelligence and machine learning problems need to be formulated within a dir...
This paper focuses on a subclass of box-constrained, non-linear optimization problems. We are partic...
peer reviewedOver the years, many optimization algorithms have been developed to solve large-scale o...
Proceeding of: 10th International Conference, IDEAL 2009, Burgos, Spain, September 23-26, 2009Many c...
Proceeding of: Ninth International Conference on Intelligent Systems Design and Applications, 2009. ...
This book covers local search for combinatorial optimization and its extension to mixed-variable opt...
The problem of dividing a sequence of values into segments occurs in database systems, information r...
AbstractThis paper introduces multi-directional local search, a metaheuristic for multi-objective op...
We present and evaluate a specific way to generate good start solutions for local search. The start ...
We present new techniques to analyze natural local search algorithms for several variants of the max...
Locating and identifying points as global minimizers is, in general, a hard and time-consuming task....
This paper proposes a Parallel Guided Local Search (PGLS) framework for continuous optimization. In ...
The purpose of this paper is twofold: first, to introduce deterministic strategies for directional d...
This paper introduces a new algorithmic technique for solving certain problems in geometric computer...
[If=2.358]International audienceThis paper presents a new local search approach for solving continuo...