1542 search results - page 168 / 309 » Kernelization of packing problems |
98
Voted
SCHEDULING
2008
15 years 1 months ago
2008
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
140
click to vote
ICML
1995
IEEE
16 years 2 months ago
1995
IEEE
Partially observable Markov decision processes (pomdp's) model decision problems in which an agent tries to maximize its reward in the face of limited and/or noisy sensor fee...
115
click to vote
AAAI
1998
15 years 3 months ago
1998
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
101
Voted
EWRL
2008
15 years 3 months ago
2008
We consider planning in a Markovian decision problem, i.e., the problem of finding a good policy given access to a generative model of the environment. We propose to use fitted Q-i...
134
click to vote
FSTTCS
2010
Springer
14 years 11 months ago
2010
Springer
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...