Results 211 to 220 of about 15,432 (253)
A Bayesian Nonparametric Approach to Test Equating
Bayesian nonparametrics, bivariate Bernstein polynomial prior, Dirichlet process prior, test equating, equipercentile equating, linear equating,
Stephen G. Walker, George Karabatsos
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Pattern Equations and Equations with Stuttering
1999Word equation in a special form X = A, where X is a sequence of variables and A is a sequence of constants, is considered. The problem whether X = A has a solution over a free monoid (Pattern- Equation problem) is shown to be NP-complete. It is also shown that disjunction of a special type equation systems and conjunction of the general ones can be ...
Ivana Cerná +2 more
openaire +3 more sources
Equations of State and Constitutive Equations
Journal of Rheology, 1986Equations-of state information in the otherwise undeformed state as a starting point for the development of constitutive equations is considered in addition to thermodynamics, free energy functions, and conceptual difficulties including the definition of reference states for strain.
Landel, Robert F., Peng, Steven T. J.
openaire +2 more sources
George Dantzig: Equations, Equations, and Equations
2013Dantzig was the progenitor of the simplex method for linear programming. A viewpoint in his spirit approaching P versus NP entirely via linear equations is presented and defended.
Richard J. Lipton, Kenneth W. Regan
openaire +1 more source
Heun’s Equation and the Hypergeometric Equation
SIAM Journal on Mathematical Analysis, 1979The present investigation determines under which circumstances Heun’s equation can be derived from the hypergeometric equation by rational substitutions.
openaire +1 more source
On Approximation of Equations by Algebraic Equations
Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, 1964Some years ago D. I. Muller [1] developed a method for the solution of algebraic equations, approximating them by quadratic equations. The method proved extremely efficient in many tests. However, the theoretical discussion given by Muller can hardly be considered as adequate, in my opinion, as his convergence proof culminates in a vicious circle (cf ...
openaire +2 more sources
Solving equations in an equational language
1988The problem of solving equations is a key and challenging problem in many formalisms of integrating logic and functional programming, while narrowing is now a widely used mechanism for generating solutions. In this paper, we continue to investigate the problem of solving equations in O'Donnell's equational language.
openaire +1 more source
On the Reduction of Differential Equations to Algebraic Equations
SIAM Journal on Mathematical Analysis, 1970Abstract : Techniques based upon elementary group theory for the reduction of a given system of partial differential equations to a system of differential equations in fewer independent variables are extended in this report. Specifically, the extension is aimed at reducing a given system to a system of algebraic equations. (Author)
Moran, M. J., Gaggioli, R. A.
openaire +2 more sources
A differential-equations algorithm for nonlinear equations
ACM Transactions on Mathematical Software, 1984Summary: DAFNE is a set of FORTRAN subprograms for solving nonlinear equations that implements a method founded on the numerical solution of a Cauchy problem for a system of ordinary differential equations inspired by classical mechanics. This paper gives a detailed description of the method as implemented in DAFNE and reports on the numerical tests ...
Filippo Aluffi-Pentini +2 more
openaire +2 more sources
IEEE Transactions on Computers, 1974
A combinational circuit realizing the switching function f(x) may be regarded as a solution verifier for the Boolean equation f(x) = 1. (*) The output of the circuit is 1, that is, if and only if the input-vector x is a solution for (*). We use the term "equational logic" to denote an approach to circuit synthesis based on (*) rather than on the ...
openaire +2 more sources
A combinational circuit realizing the switching function f(x) may be regarded as a solution verifier for the Boolean equation f(x) = 1. (*) The output of the circuit is 1, that is, if and only if the input-vector x is a solution for (*). We use the term "equational logic" to denote an approach to circuit synthesis based on (*) rather than on the ...
openaire +2 more sources

