Sciweavers

727 search results - page 107 / 146
» Private approximation of search problems
Sort
View
NIPS
1997
13 years 11 months ago
Learning to Order Things
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
William W. Cohen, Robert E. Schapire, Yoram Singer
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
14 years 3 months ago
Morphing methods in evolutionary design optimization
Design optimization is a well established application field of evolutionary computation. However, standard recombination operators acting on the genotypic representation of the d...
Michael Nashvili, Markus Olhofer, Bernhard Sendhof...
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
13 years 11 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...
SASO
2007
IEEE
14 years 4 months ago
On Scaling Multi-Agent Task Reallocation Using Market-Based Approach
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
Rajesh K. Karmani, Timo Latvala, Gul Agha
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
14 years 4 months ago
Transgenetic algorithm: a new evolutionary perspective for heuristics design
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...