Sciweavers

3841 search results - page 121 / 769
» Crowdsourcing for search evaluation
Sort
View
AIPS
2006
15 years 7 months ago
Automated Web Service Composition by On-the-Fly Belief Space Search
Composition of stateful web services expressed in BPEL4WS can be recasted as a problem of planning in asynchronous domains. In (PTB05), this is pursued by encoding the asynchronou...
Piergiorgio Bertoli, Marco Pistore, Paolo Traverso
AAAI
1994
15 years 7 months ago
Learning Explanation-Based Search Control Rules for Partial Order Planning
This paper presents snlp+ebl, the first implementation of explanation based learning techniques for a partial order planner. We describe the basic learning framework of snlp+ebl, ...
Suresh Katukam, Subbarao Kambhampati
ICGA
1993
75views Optimization» more  ICGA 1993»
15 years 7 months ago
Structure and Performance of Fine-Grain Parallelism in Genetic Search
Within the parallel genetic algorithm framework, there currently exists a growing dichotomy between coarse-pain and fine-grain parallel architectures. This paper attempts to chara...
Shumeet Baluja
BMCBI
2005
144views more  BMCBI 2005»
15 years 6 months ago
GeneRank: Using search engine technology for the analysis of microarray experiments
Background: Interpretation of simple microarray experiments is usually based on the fold-change of gene expression between a reference and a "treated" sample where the t...
Julie L. Morrison, Rainer Breitling, Desmond J. Hi...
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
15 years 11 months ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed
The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions defined on a continuous search space in a black-box scenario. In this paper, an i...
Anne Auger, Nikolaus Hansen