Sciweavers

2131 search results - page 120 / 427
» Immunity for Closed Sets
Sort
View
EVOW
2008
Springer
15 years 8 months ago
A Study of Some Implications of the No Free Lunch Theorem
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
Andrea Valsecchi, Leonardo Vanneschi
CORR
2008
Springer
136views Education» more  CORR 2008»
15 years 6 months ago
Multi-Armed Bandits in Metric Spaces
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
IJAC
2008
84views more  IJAC 2008»
15 years 6 months ago
Groups whose Geodesics are Locally Testable
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
Susan M. Hermiller, Derek F. Holt, Sarah Rees
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
15 years 6 months ago
Enlarging the domain of attraction of MPC controllers
This paper presents a method for enlarging the domain of attraction of nonlinear model predictive control (MPC). The usual way of guaranteeing stability of nonlinear MPC is to add...
Daniel Limón, T. Alamo, Eduardo F. Camacho
IEEECIT
2010
IEEE
15 years 4 months ago
Adaptive Algorithms for Efficient Content Management in Social Network Services
Identifying the set of resources that are expected to receive the majority of requests in the near future, namely hot set, is at the basis of most content management strategies of...
Claudia Canali, Michele Colajanni, Riccardo Lancel...