447 search results - page 55 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
ICDT
2010
ACM
14 years 18 days ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
RECOMB
2003
Springer
14 years 8 months ago
2003
Springer
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...