Sciweavers

502 search results - page 10 / 101
» Monotone Approximation of Decision Problems
Sort
View
SIAMCO
2010
128views more  SIAMCO 2010»
13 years 9 months ago
A Parallel Splitting Method for Coupled Monotone Inclusions
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces, and its convergence is established under the assumption that solutions...
Hedy Attouch, Luis M. Briceño-Arias, Patric...
IJCAI
2007
14 years 6 days ago
Learning from Partial Observations
We present a general machine learning framework for modelling the phenomenon of missing information in data. We propose a masking process model to capture the stochastic nature of...
Loizos Michael
IJCAI
2001
14 years 4 days ago
An Improved Grid-Based Approximation Algorithm for POMDPs
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
Rong Zhou, Eric A. Hansen
ECCC
2010
124views more  ECCC 2010»
13 years 11 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
14 years 5 months ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß