Sciweavers

1795 search results - page 165 / 359
» Search by strategy
Sort
View
TELSYS
2011
207views Education» more  TELSYS 2011»
15 years 1 months ago
GRASP: basic components and enhancements
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
Paola Festa, Mauricio G. C. Resende
ICTAI
1993
IEEE
15 years 10 months ago
MERIT Motifs
MERIT (Multimedia Extensions of Retrieval Interaction Tools)1 provides a user-centered interface to a database covering European research programs, projects, and consortia in the ...
Ulrich Thiel, Martin Kracker, Adelheit Stein
ICALP
2003
Springer
15 years 11 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
FGCS
2000
81views more  FGCS 2000»
15 years 6 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
BMCBI
2007
89views more  BMCBI 2007»
15 years 6 months ago
msmsEval: tandem mass spectral quality assignment for high-throughput proteomics
Background: In proteomics experiments, database-search programs are the method of choice for protein identification from tandem mass spectra. As amino acid sequence databases grow...
Jason W. H. Wong, Matthew J. Sullivan, Hugh M. Car...