Sciweavers

890 search results - page 34 / 178
» New Approaches to Compare Phylogenetic Search Heuristics
Sort
View
109
Voted
IPPS
2005
IEEE
15 years 7 months ago
MaTCH : Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
Soumya Sanyal, Sajal K. Das
97
Voted
CP
2009
Springer
15 years 8 months ago
Exploiting Problem Decomposition in Multi-objective Constraint Optimization
Multi-objective optimization is concerned with problems involving multiple measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-...
Radu Marinescu
EUSFLAT
2007
150views Fuzzy Logic» more  EUSFLAT 2007»
15 years 3 months ago
Competitive Self-adaptation in Evolutionary Algorithms
Heuristic search for the global minimum is studied. This paper is focused on the adaptation of control parameters in differential evolution (DE) and in controlled random search (...
Josef Tvrdík, Ivan Krivý
SBIA
2004
Springer
15 years 7 months ago
Applying a Lexical Similarity Measure to Compare Portuguese Term Collections
The number of ontologies publicly available and accessible through the web has increased in the last years, so that the task of finding similar terms1 among these structures becom...
Marcirio Silveira Chaves, Vera Lúcia Strube...
CSR
2008
Springer
15 years 3 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma