Sciweavers

4131 search results - page 158 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
167
Voted
AAAI
2011
14 years 3 months ago
Linear Dynamic Programs for Resource Management
Sustainable resource management in many domains presents large continuous stochastic optimization problems, which can often be modeled as Markov decision processes (MDPs). To solv...
Marek Petrik, Shlomo Zilberstein
138
Voted
CORR
2012
Springer
174views Education» more  CORR 2012»
13 years 11 months ago
Partial Searchlight Scheduling is Strongly PSPACE-complete
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
Giovanni Viglietta
173
Voted
CORR
2012
Springer
225views Education» more  CORR 2012»
13 years 11 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
JMLR
2002
137views more  JMLR 2002»
15 years 3 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
ACTA
2008
136views more  ACTA 2008»
15 years 3 months ago
Two-dimensional packing with conflicts
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
Leah Epstein, Asaf Levin, Rob van Stee