Sciweavers

1802 search results - page 193 / 361
» Sparse Computations with PEI
Sort
View
IJCAI
2007
15 years 6 months ago
Using Linear Programming for Bayesian Exploration in Markov Decision Processes
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
Pablo Samuel Castro, Doina Precup
CLEF
2010
Springer
15 years 5 months ago
DAEDALUS at WebPS-3 2010: k-Medoids Clustering Using a Cost Function Minimization
This paper describes the participation of DAEDALUS team at the WebPS-3 Task 1, regarding Web People Search. The focus of our research is to evaluate and compare the computational r...
Sara Lana-Serrano, Julio Villena-Román, Jos...
140
Voted
DAWAK
2010
Springer
15 years 5 months ago
Using Transitivity to Increase the Accuracy of Sample-Based Pearson Correlation Coefficients
Abstract. Pearson product-moment correlation coefficients are a wellpracticed quantification of linear dependence seen across many fields. When calculating a sample-based correlati...
Taylor Phillips, Chris GauthierDickey, Ramki Thuri...
RECSYS
2010
ACM
15 years 4 months ago
Recommending based on rating frequencies
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
Fatih Gedikli, Dietmar Jannach
COR
2010
105views more  COR 2010»
15 years 4 months ago
Effective formulation reductions for the quadratic assignment problem
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
Huizhen Zhang, Cesar Beltran-Royo, Miguel Constant...