Sciweavers

10909 search results - page 505 / 2182
» Evaluating Backup Algorithms
Sort
View
BVAI
2005
Springer
16 years 12 days ago
Incomplete Contour Representations and Shape Descriptors: ICR Test Studies
Inspired by psychophysical studies of the human cognitive abilities we propose a novel aspect and a method for performance evaluation of contour based shape recognition algorithms ...
Anarta Ghosh, Nicolai Petkov
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
15 years 8 months ago
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
TEC
2002
152views more  TEC 2002»
15 years 6 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck
MDM
2005
Springer
174views Communications» more  MDM 2005»
16 years 13 days ago
GPAC: generic and progressive processing of mobile queries over mobile data
This paper introduces a new family of Generic and Progressive algorithms (GPAC, for short) for continuous mobile queries over mobile objects. GPAC provides a general skeleton that...
Mohamed F. Mokbel, Walid G. Aref
CSL
2001
Springer
15 years 11 months ago
An Existential Locality Theorem
We prove an existential version of Gaifman’s locality theorem and show how it can be applied algorithmically to evaluate existential first-order sentences in finite structures....
Martin Grohe, Stefan Wöhrle