Sciweavers

1139 search results - page 133 / 228
» Bounded Ideation Theory
Sort
View
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
13 years 12 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
FOCS
2004
IEEE
13 years 11 months ago
Extracting Randomness Using Few Independent Sources
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
Boaz Barak, Russell Impagliazzo, Avi Wigderson
WG
1995
Springer
13 years 11 months ago
On Interval Routing Schemes and Treewidth
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
Hans L. Bodlaender, Richard B. Tan, Dimitrios M. T...
ATAL
2008
Springer
13 years 10 months ago
Approximate predictive state representations
Predictive state representations (PSRs) are models that represent the state of a dynamical system as a set of predictions about future events. The existing work with PSRs focuses ...
Britton Wolfe, Michael R. James, Satinder P. Singh
EUSFLAT
2007
152views Fuzzy Logic» more  EUSFLAT 2007»
13 years 9 months ago
The Core of Games on Distributive Lattices
Cooperative games under precedence constraints have been introduced by Faigle and Kern [1] , [4] as a generalization of classical cooperative games. An important notion in coopera...
Lijue Xie, Michel Grabisch