Sciweavers

340 search results - page 42 / 68
» Clustering with Lower Bound on Similarity
Sort
View
CIMCA
2008
IEEE
16 years 17 days ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis
CLUSTER
2005
IEEE
15 years 11 months ago
Toward an Optimal Redundancy Strategy for Distributed Computations
Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The related computation integrity concerns are commonly...
Doug Szajda, Barry Lawson, Jason Owen
155
Voted
MFCS
2009
Springer
16 years 19 days ago
Future-Looking Logics on Data Words and Trees
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...
Diego Figueira, Luc Segoufin
JMLR
2012
13 years 8 months ago
Contextual Bandit Learning with Predictable Rewards
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...
Alekh Agarwal, Miroslav Dudík, Satyen Kale,...
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
16 years 20 days ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....