Sciweavers

1813 search results - page 142 / 363
» Instance Pruning Techniques
Sort
View
ICALP
2000
Springer
15 years 10 months ago
Efficient Verification Algorithms for One-Counter Processes
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
Antonín Kucera
AAAI
2007
15 years 8 months 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...
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 6 months ago
Online Learning of Noisy Data with Kernels
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
JAR
2008
81views more  JAR 2008»
15 years 6 months ago
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
Mark H. Liffiton, Karem A. Sakallah
PPL
2008
101views more  PPL 2008»
15 years 6 months ago
Skeletal Parallel Programming with OCamlP3l 2.0
Parallel programming has proven to be an effective technique to improve the performance of computationally intensive applications. However, writing parallel programs is not easy, ...
Roberto Di Cosmo, Zheng Li, Susanna Pelagatti, Pie...