Sciweavers

1356 search results - page 128 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
NIPS
2008
13 years 10 months ago
Algorithms for Infinitely Many-Armed Bandits
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments. We make a stochastic assumption on the mean-reward of a new sel...
Yizao Wang, Jean-Yves Audibert, Rémi Munos
AE
2009
Springer
13 years 10 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
EOR
2006
65views more  EOR 2006»
13 years 9 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini
KES
2008
Springer
13 years 9 months ago
Incremental evolution of a signal classification hardware architecture for prosthetic hand control
Evolvable Hardware (EHW) is a new method for designing electronic circuits. However, there are several problems to solve for making high performance systems. One is the limited sca...
Jim Torresen
TEC
1998
99views more  TEC 1998»
13 years 8 months ago
Fitness sharing and niching methods revisited
Abstract—Interest in multimodal optimization function is expanding rapidly since real-world optimization problems often require the location of multiple optima in the search spac...
Bruno Sareni, Laurent Krähenbühl