Sciweavers

1208 search results - page 42 / 242
» Uniform eventown problems
Sort
View
ML
2002
ACM
133views Machine Learning» more  ML 2002»
14 years 11 months ago
Finite-time Analysis of the Multiarmed Bandit Problem
Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while t...
Peter Auer, Nicolò Cesa-Bianchi, Paul Fisch...
DSVIS
2005
Springer
15 years 5 months ago
Solving the Mapping Problem in User Interface Design by Seamless Integration in IdealXML
The mapping problem has been defined as the way to map models involved throughout the development life cycle of user interfaces. Model-based design of user interfaces has followed ...
Francisco Montero, Víctor López-Jaqu...
KCAP
2003
ACM
15 years 5 months ago
A generic library of problem solving methods for scheduling applications
In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...
Dnyanesh G. Rajpathak, Enrico Motta, Zdenek Zdr&aa...
CORR
2007
Springer
147views Education» more  CORR 2007»
14 years 11 months ago
Coding Solutions for the Secure Biometric Storage Problem
—The paper studies the problem of securely storing biometric passwords, such as fingerprints and irises. With the help of coding theory Juels and Wattenberg derived in 1999 a sc...
Davide Schipani, Joachim Rosenthal
102
Voted
CPC
2007
97views more  CPC 2007»
14 years 11 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger