Results 1  10
of
14,142
THE COMPLEX INVERSION FORMULA REVISITED
"... Abstract. We give a simplified proof of the complex inversion formula for semigroups and — more generally — solution families for scalartype Volterra equations, including the stronger versions on UMD spaces. Our approach is based on (elementary) Fourier analysis. 1. ..."
Abstract
 Add to MetaCart
Abstract. We give a simplified proof of the complex inversion formula for semigroups and — more generally — solution families for scalartype Volterra equations, including the stronger versions on UMD spaces. Our approach is based on (elementary) Fourier analysis. 1.
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved
NonUniform Random Variate Generation
, 1986
"... This is a survey of the main methods in nonuniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and transformations are reviewed. We provide information on the expected time complexity of various algorith ..."
Abstract

Cited by 1021 (26 self)
 Add to MetaCart
This is a survey of the main methods in nonuniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and transformations are reviewed. We provide information on the expected time complexity of various
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
of states. We describe a general method that represents the state space symbolical/y instead of explicitly. The generality of our method comes from using a dialect of the MuCalculus as the primary specification language. We describe a model checking algorithm for MuCalculus formulas that uses Bryant’s
Statistics for Experimenters
, 2005
"... R factor = 0.052; wR factor = 0.114; datatoparameter ratio = 18.4. The title compound, [Zn(C8H10F3O2)2(CH4O)2], is a dimethanol coordinated zinc complex with the acetyl acetonate derivative 1,1,1trifluoro5,5dimethylhexane2,4dionate. The bisdiketonate complex, which is isostructural with its ..."
Abstract

Cited by 675 (1 self)
 Add to MetaCart
Co analogue, is located on a crystallographic inversion center. The complex is octahedral with basically no distortion, and the methanol molecules are in trans positions with respect to one another. The planes of thediketonate and the ZnO4 unit are tilted by 18.64 (10) against each other. O—H O
Factoring wavelet transforms into lifting steps
 J. FOURIER ANAL. APPL
, 1998
"... This paper is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This decompositio ..."
Abstract

Cited by 584 (8 self)
 Add to MetaCart
. This decomposition corresponds to a factorization of the polyphase matrix of the wavelet or subband filters into elementary matrices. That such a factorization is possible is wellknown to algebraists (and expressed by the formula); it is also used in linear systems theory in the electrical engineering community. We
Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,
, 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
motivated work behavior to develop; (b) the characteristics of jobs that can create these psychological states; and (c) the attributes of individuals that determine how positively a person will respond to a complex and challenging job. The model was tested for 658 employees who work on 62 different jobs
Alloy: A Lightweight Object Modelling Notation
, 2001
"... Alloy is a little language for describing structural properties. It offers a declaration syntax compatible with graphical object models, and a setbased formula syntax powerful enough to express complex constraints and yet amenable to a fully automatic semantic analysis. Its meaning is given by tr ..."
Abstract

Cited by 459 (17 self)
 Add to MetaCart
Alloy is a little language for describing structural properties. It offers a declaration syntax compatible with graphical object models, and a setbased formula syntax powerful enough to express complex constraints and yet amenable to a fully automatic semantic analysis. Its meaning is given
The Computational Complexity of Propositional STRIPS Planning
 Artificial Intelligence
, 1994
"... I present several computational complexity results for propositional STRIPS planning, i.e., STRIPS planning restricted to ground formulas. Different planning problems can be defined by restricting the type of formulas, placing limits on the number of pre and postconditions, by restricting negation ..."
Abstract

Cited by 363 (3 self)
 Add to MetaCart
I present several computational complexity results for propositional STRIPS planning, i.e., STRIPS planning restricted to ground formulas. Different planning problems can be defined by restricting the type of formulas, placing limits on the number of pre and postconditions, by restricting negation
INVERSION THEOREM FOR THE WHITTAKER. TRANSFORM OF CERTAIN DISTRIBUTIONS
"... în this paper we propose to extend a Complexinversion formula igiven by R. S. Varma [3] to a certain class of distributions. R. S. Varma [3] proved the following Complexinversion formula ..."
Abstract
 Add to MetaCart
în this paper we propose to extend a Complexinversion formula igiven by R. S. Varma [3] to a certain class of distributions. R. S. Varma [3] proved the following Complexinversion formula
Results 1  10
of
14,142