Sciweavers

236 search results - page 33 / 48
» Learning How to Propagate Using Random Probing
Sort
View
AAAI
2007
14 years 11 days ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
CP
1998
Springer
14 years 2 months ago
Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
Daniel Frost, Rina Dechter
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 10 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
ICCV
2009
IEEE
15 years 3 months ago
A Probabilistic Framework for Partial Intrinsic Symmetries in Geometric Data
In this paper, we present a novel algorithm for partial intrinsic symmetry detection in 3D geometry. Unlike previous work, our algorithm is based on a conceptually simple and st...
Ruxandra Lasowski, Art Tevs, Hans-Peter Seidel, Mi...
DSN
2009
IEEE
14 years 4 months ago
Fault isolation for device drivers
This work explores the principles and practice of isolating low-level device drivers in order to improve OS dependability. In particular, we explore the operations drivers can per...
Jorrit N. Herder, Herbert Bos, Ben Gras, Philip Ho...