Sciweavers

531 search results - page 61 / 107
» A Better Algorithm for Random k-SAT
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Combining online and offline knowledge in UCT
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
Sylvain Gelly, David Silver
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 8 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
TEC
2008
165views more  TEC 2008»
13 years 7 months ago
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several app...
Shengxiang Yang, Xin Yao
PAMI
2007
166views more  PAMI 2007»
13 years 7 months ago
A Comparison of Decision Tree Ensemble Creation Techniques
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
TIP
2010
94views more  TIP 2010»
13 years 2 months ago
User-Friendly Interactive Image Segmentation Through Unified Combinatorial User Inputs
One weakness in the existing interactive image segmentation algorithms is the lack of more intelligent ways to understand the intention of user inputs. In this paper, we advocate t...
Wenxian Yang, Jianfei Cai, Jianmin Zheng, Jiebo Lu...