Sciweavers

99 search results - page 13 / 20
» Automating role-based provisioning by learning from examples
Sort
View
MCS
2010
Springer
14 years 2 months ago
Online Non-stationary Boosting
Abstract. Oza’s Online Boosting algorithm provides a version of AdaBoost which can be trained in an online way for stationary problems. One perspective is that this enables the p...
Adam Pocock, Paraskevas Yiapanis, Jeremy Singer, M...
IJCAI
2007
13 years 10 months ago
Using Learned Policies in Heuristic-Search Planning
Many current state-of-the-art planners rely on forward heuristic search. The success of such search typically depends on heuristic distance-to-the-goal estimates derived from the ...
Sung Wook Yoon, Alan Fern, Robert Givan
ILP
2005
Springer
14 years 2 months ago
Online Closure-Based Learning of Relational Theories
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...
Frédéric Koriche
TSE
2008
91views more  TSE 2008»
13 years 9 months ago
Privately Finding Specifications
Buggy software is a reality and automated techniques for discovering bugs are highly desirable. A specification describes the correct behavior of a program. For example, a file mus...
Westley Weimer, Nina Mishra
KI
2009
Springer
14 years 3 months ago
Presenting Proofs with Adapted Granularity
When mathematicians present proofs they usually adapt their explanations to their didactic goals and to the (assumed) knowledge of their addressees. Modern automated theorem prover...
Marvin Schiller, Christoph Benzmüller