1429 search results - page 92 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
SIGMOD
2010
ACM
14 years 2 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
UAI
2008
13 years 10 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
TAMC
2009
Springer
14 years 1 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
ATMOS
2010
13 years 8 months ago
2010
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...