42230 search results - page 7972 / 8446 » Algorithms and Complexity Results for |
206
click to vote
DCOSS
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. It is an undeniable fact that people want information. Unfortunately, even in today's highly automated society, a lot of the information we desire is still manually ...
190
click to vote
ESA
2008
Springer
15 years 9 months ago
2008
Springer
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
255
click to vote
FMSB
2008
15 years 8 months ago
2008
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
198
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
199
click to vote
AAAI
2010
15 years 8 months ago
2010
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...