Sciweavers

16404 search results - page 540 / 3281
» A set coverage problem
Sort
View
AAAI
2006
15 years 8 months ago
An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem
We present an asymptotically optimal algorithm for the max variant of the k-armed bandit problem. Given a set of k slot machines, each yielding payoff from a fixed (but unknown) d...
Matthew J. Streeter, Stephen F. Smith
CCCG
1993
15 years 8 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
GECCO
2008
Springer
164views Optimization» more  GECCO 2008»
15 years 8 months ago
Genetic algorithms with local search optimization for protein structure prediction problem
This paper presents a new Genetic Algorithm for Protein Structure Prediction problem in both 2D and 3D hydrophobichydrophilic lattice models, introduced in [1]. Our algorithm evol...
Igor Berenboym, Mireille Avigal
COR
2008
111views more  COR 2008»
15 years 7 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
CORR
2008
Springer
216views Education» more  CORR 2008»
15 years 7 months ago
Building an interpretable fuzzy rule base from data using Orthogonal Least Squares Application to a depollution problem
In many fields where human understanding plays a crucial role, such as bioprocesses, the capacity of extracting knowledge from data is of critical importance. Within this framewor...
Sébastien Destercke, Serge Guillaume, Brigi...