455 search results - page 61 / 91 » Approximation Algorithms for Partial Covering Problems |
154
click to vote
PKDD
2010
Springer
14 years 9 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
89
Voted
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
Several recent control applications consider the coordination of subsystems through local interaction. Often the interaction has a symmetry in state space, e.g. invariance with res...
AIPS
2003
15 years 1 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
AIPS
2004
15 years 1 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...