Sciweavers

14739 search results - page 285 / 2948
» An optimization problem on the sphere
Sort
View
CORR
2012
Springer
216views Education» more  CORR 2012»
13 years 7 months ago
Fractional Moments on Bandit Problems
Reinforcement learning addresses the dilemma between exploration to find profitable actions and exploitation to act according to the best observations already made. Bandit proble...
Ananda Narayanan B., Balaraman Ravindran
ICALP
2009
Springer
15 years 11 months ago
The Ehrenfeucht-Silberger Problem
We consider repetitions in words and solve a longstanding open problem about the relation between the period and the length of its longest unbordered factor. A word u is called bor...
Stepan Holub, Dirk Nowotka
HYBRID
2009
Springer
15 years 6 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...
CAIP
2009
Springer
246views Image Analysis» more  CAIP 2009»
15 years 5 months ago
Human Age Estimation by Metric Learning for Regression Problems
Abstract. The estimation of human age from face images is an interesting problem in computer vision. We proposed a general distance metric learning scheme for regression problems, ...
Yangjing Long
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
15 years 5 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl