Results 1  10
of
5,269,609
Results on ResourceBounded Measure
, 1997
"... . We construct an oracle relative to which NP has pmeasure 0 but D p has measure 1 in EXP. This gives a strong relativized negative answer to a question posed by Lutz [Lut96]. Secondly, we give strong evidence that BPP is small. We show that BPP has pmeasure 0 unless EXP = MA and thus the polyn ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
the polynomialtime hierarchy collapses. This contrasts with the work of Regan et. al. [RSC95], where it is shown that P=poly does not have pmeasure 0 if exponentially strong pseudorandom generators exist. 1 Introduction Since the introduction of resourcebounded measure by Lutz [Lut92], many researchers
Two Results on ResourceBounded Measure
, 1996
"... We construct an oracle relative to which NP has pmeasure 0 but D p has measure 1 in EXP. This gives a strong relativized negative answer to a question posed by Lutz [Lut96]. Secondly, we give strong evidence that BPP is small. We show that BPP has pmeasure 0 unless EXP = MA and the polynomialti ..."
Abstract
 Add to MetaCart
time hierarchy collapses. This contrasts the work of Regan et al. [RSC95], where it is shown that P=poly does not have pmeasure 0 unless strong pseudorandom generators do not exist. 1 Introduction Since the introduction of resourcebounded measure by Lutz [Lut92], many researchers investigated the size
ResourceBounded Measure and Randomness
"... We survey recent results on resourcebounded measure and randomness in structural complexity theory. In particular, we discuss applications of these concepts to the exponential time complexity classes and . Moreover, we treat timebounded genericity and stochasticity concepts which are weaker than ..."
Abstract

Cited by 43 (6 self)
 Add to MetaCart
We survey recent results on resourcebounded measure and randomness in structural complexity theory. In particular, we discuss applications of these concepts to the exponential time complexity classes and . Moreover, we treat timebounded genericity and stochasticity concepts which are weaker than
Plans And ResourceBounded Practical Reasoning
 COMPUTATIONAL INTELLIGENCE, 4(4):349355, 1988
, 1988
"... An architecture for a rational agent must allow for meansend reasoning, for the weighing of competing alternatives, and for interactions between these two forms of reasoning. Such an architecture must also address the problem of resource boundedness. We sketch a solution of the first problem that p ..."
Abstract

Cited by 485 (19 self)
 Add to MetaCart
that points the way to a solution of the second. In particular, we present a highlevel specification of the practicalreasoning component of an architecture for a resourcebounded rational agent. In this architecture, a major role of the agent's plans is to constrain the amount of further practical
On Pseudorandomness and ResourceBounded Measure
 Theoretical Computer Science
, 1997
"... In this paper we extend a key result of Nisan and Wigderson [17] to the nondeterministic setting: for all ff ? 0 we show that if there is a language in E = DTIME(2 O(n) ) that is hard to approximate by nondeterministic circuits of size 2 ffn , then there is a pseudorandom generator that can be u ..."
Abstract

Cited by 43 (3 self)
 Add to MetaCart
for ZPP NP . 1 Introduction In recent years, following the development of resourcebounded meas...
ResourceBounded Measure and Autoreducibility
, 1996
"... We prove that the following classes have resourcebounded measure zero: ffl the class of selfreducible sets. ffl the class of commitable sets. ffl the class of sets that are nonadaptively autoreducible with a linear number of queries. ffl the class of disjunctively autoreducible sets. 1 Intro ..."
Abstract
 Add to MetaCart
We prove that the following classes have resourcebounded measure zero: ffl the class of selfreducible sets. ffl the class of commitable sets. ffl the class of sets that are nonadaptively autoreducible with a linear number of queries. ffl the class of disjunctively autoreducible sets. 1
ResourceBounded Partial Evaluation
 In Proceedings of PEPM’97, the ACM SIGPLAN Symposium on Partial Evaluation and SemanticsBased Program Manipulation
"... Most partial evaluators do not take the availability of machinelevel resources, such as registers or cache, into consideration when making their specialization decisions. The resulting resource contention can lead to severe performance degradationcausing, in extreme cases, the specialized code ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
code to run slower than the unspecialized code. In this paper we consider how resource considerations can be incorporated within a partial evaluator. We develop an abstract formulation of the problem, show that optimal resourcebounded partial evaluation is NPcomplete, and discuss simple heuristics
On ResourceBounded Instance Complexity
 Theoretical Computer Science A
, 1995
"... The instance complexity of a string x with respect to a set A and time bound t, ic t (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, and makes no mistakes on other strings (where "don't know" answers are permitted). The Instance Complexit ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
The instance complexity of a string x with respect to a set A and time bound t, ic t (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, and makes no mistakes on other strings (where "don't know" answers are permitted). The Instance
Coherent Measures of Risk
, 1998
"... In this paper we study both market risks and nonmarket risks, without complete markets assumption, and discuss methods of measurement of these risks. We present and justify a set of four desirable properties for measures of risk, and call the measures satisfying these properties "coherent" ..."
Abstract

Cited by 882 (4 self)
 Add to MetaCart
In this paper we study both market risks and nonmarket risks, without complete markets assumption, and discuss methods of measurement of these risks. We present and justify a set of four desirable properties for measures of risk, and call the measures satisfying these properties "
Results 1  10
of
5,269,609