210 search results - page 42 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
TSP
2010
12 years 11 months ago
2010
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
ADC
2003
Springer
13 years 10 months ago
2003
Springer
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
TCS
1998
13 years 4 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...