Sciweavers

576 search results - page 19 / 116
» Matching methodology to problem domain
Sort
View
EVOW
2010
Springer
14 years 1 months ago
Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
EUROGP
2007
Springer
145views Optimization» more  EUROGP 2007»
14 years 1 months ago
GP Classifier Problem Decomposition Using First-Price and Second-Price Auctions
This work details an auction-based model for problem decomposition in Genetic Programming classification. The approach builds on the population-based methodology of Genetic Progra...
Peter Lichodzijewski, Malcolm I. Heywood
PUK
2003
13 years 11 months ago
On the Decomposition and Concurrent Resolution of a Planning Problem
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
Laura Sebastia, Eva Onaindia, Eliseo Marzal
ERCIMDL
2006
Springer
102views Education» more  ERCIMDL 2006»
14 years 1 months ago
On the Problem of Identifying the Quality of Geographic Metadata
Geographic metadata quality is one of the most important aspects on the performance of Geographic Digital Libraries. After reviewing previous attempts outside the geographic domain...
Rafael Tolosana-Calasanz, José A. Ál...
ADC
2007
Springer
170views Database» more  ADC 2007»
14 years 4 months ago
Pruning SIFT for Scalable Near-duplicate Image Matching
The detection of image versions from large image collections is a formidable task as two images are rarely identical. Geometric variations such as cropping, rotation, and slight p...
Jun Jie Foo, Ranjan Sinha