Sciweavers

1914 search results - page 36 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
INFOVIS
2000
IEEE
14 years 27 days ago
Interactive Problem Solving via Algorithm Visualization
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...
Pearl Pu, Denis Lalanne
GECCO
2009
Springer
153views Optimization» more  GECCO 2009»
14 years 1 months ago
Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed
In this paper, we benchmark the (1+1) Evolution Strategy (ES) with one-fifth success rule which is one of the first and simplest adaptive search algorithms proposed for optimiza...
Anne Auger
BIS
2011
289views Business» more  BIS 2011»
12 years 8 months ago
Advanced Resource Selection for Federated Enterprise Search
Distributed information retrieval is a well-known approach for accessing heterogeneous, highly autonomous sources of unstructured information. Selecting and querying only a number ...
Matthias Wauer, Daniel Schuster, Alexander Schill
BIRD
2008
Springer
110views Bioinformatics» more  BIRD 2008»
13 years 10 months ago
SVM-Based Local Search for Gene Selection and Classification of Microarray Data
Abstract. This paper presents a SVM-based local search (SVM-LS) approach to the problem of gene selection and classification of microarray data. The proposed approach is highlighte...
Jose Crispin Hernandez Hernandez, Béatrice ...
MDM
2010
Springer
281views Communications» more  MDM 2010»
13 years 10 months ago
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
Jie Bao 0003, Chi-Yin Chow, Mohamed F. Mokbel, Wei...