Sciweavers

1568 search results - page 164 / 314
» The problem of examination questions in algorithmics
Sort
View
JMLR
2002
140views more  JMLR 2002»
15 years 6 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
ROBOCUP
2007
Springer
106views Robotics» more  ROBOCUP 2007»
16 years 15 days ago
Beyond Frontier Exploration
This article investigates the prerequisites for a global exploration strategy in an unknown environment on a virtual disaster site. Assume that a robot equipped with a laser range...
Arnoud Visser, Xingrui-Ji, Merlijn van Ittersum, L...
WABI
2007
Springer
16 years 15 days ago
Predicting Protein Folding Kinetics Via Temporal Logic Model Checking
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...
Christopher James Langmead, Sumit Kumar Jha
DEXA
2005
Springer
160views Database» more  DEXA 2005»
15 years 12 months ago
Improved Sequential Pattern Mining Using an Extended Bitmap Representation
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
Chien-Liang Wu, Jia-Ling Koh, Pao-Ying An
GECCO
2009
Springer
188views Optimization» more  GECCO 2009»
15 years 10 months ago
Exploiting multiple classifier types with active learning
Many approaches to active learning involve training one classifier by periodically choosing new data points about which the classifier has the least confidence, but designing a co...
Zhenyu Lu, Josh Bongard