Sciweavers

1298 search results - page 130 / 260
» The online set cover problem
Sort
View
UAI
1997
15 years 7 months ago
Update Rules for Parameter Estimation in Bayesian Networks
This paper re-examines the problem of parameter estimation in Bayesian networks with missing values and hidden variables from the perspective of recent work in on-line learning [1...
Eric Bauer, Daphne Koller, Yoram Singer
ICML
2009
IEEE
16 years 7 months ago
A simpler unified analysis of budget perceptrons
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
Ilya Sutskever
AAAI
2007
15 years 8 months ago
Learning to Solve QBF
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with machine learning techniques. We show how classification met...
Horst Samulowitz, Roland Memisevic
RSA
2011
121views more  RSA 2011»
15 years 1 months ago
Ramsey games with giants
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
Tom Bohman, Alan M. Frieze, Michael Krivelevich, P...
BROADNETS
2007
IEEE
16 years 25 days ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta