Sciweavers

3780 search results - page 348 / 756
» Algorithms for Game Metrics
Sort
View
204
Voted
PAAMS
2010
Springer
16 years 9 days ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
182
Voted
CORR
2007
Springer
73views Education» more  CORR 2007»
15 years 7 months ago
Universal Reinforcement Learning
—We consider an agent interacting with an unmodeled environment. At each time, the agent makes an observation, takes an action, and incurs a cost. Its actions can influence futu...
Vivek F. Farias, Ciamac Cyrus Moallemi, Tsachy Wei...
184
Voted
ICML
2008
IEEE
16 years 8 months ago
An empirical evaluation of supervised learning in high dimensions
In this paper we perform an empirical evaluation of supervised learning on highdimensional data. We evaluate performance on three metrics: accuracy, AUC, and squared loss and stud...
Rich Caruana, Nikolaos Karampatziakis, Ainur Yesse...
WWW
2007
ACM
16 years 8 months ago
Adaptive record extraction from web pages
We describe an adaptive method for extracting records from web pages. Our algorithm combines a weighted tree matching metric with clustering for obtaining data extraction patterns...
Justin Park, Denilson Barbosa
195
Voted
SPIRE
2005
Springer
16 years 1 months ago
Normalized Similarity of RNA Sequences
We introduce a normalized version of the LCS metric as a new local similarity measure for comparing two RNAs. An O(n2 m lg m) time algorithm is presented for computing the maximum ...
Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren...