We have developed an algorithm for reduction of search-space, called Domain Optimization Algorithm (DOA), applied to global optimization. This approach can efficiently eliminate search-space regions with low probability of containing a global optimum. DOA basically works using simple models for search-space regions to identify and eliminate non-promising regions. The proposed approach has shown relevant results
We have developed an algorithm using a Design of Experiments technique for reduction of search-space in global optimization problems. Our approach is called Domain Optimization Algorithm. This approach can efficiently eliminate search-space regions with low probability of containing a global optimum. The Domain Optimization Algorithm approach is based on eliminating non-promising search-space regions, which are
In this work we present an approach to extract and to structure bibliographical references from BibTex files, allowing the identification of the duplicate ones, which can appear slightly different in different files. To deal with this problem, existing systems use classifiers, clustering or others algorithms, allied with an Edit Distance metric, to distinguish between duplicate
Vinícius Veloso de Melo is an Assistant Professor of Computer Science at
Federal University of São Paulo, São José dos Campos, SP, Brazil.
Email: (blanks against robots): myfirstname dot mylastname at unifesp dot br
Don't use accents in the email!