3875 search results - page 542 / 775 » Approximation algorithms for the 0-extension problem |
167
Voted
ICMLA
2008
15 years 8 months ago
2008
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...
156
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
151
click to vote
SCHEDULING
2008
15 years 6 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...
163
click to vote
MOBIHOC
2010
ACM
15 years 4 months ago
2010
ACM
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
195
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...