Results 1  10
of
6,877
Comparing Alternative Formulations for the ARM
"... In this article we study the effectiveness of alternative integer programming formulations for area constrained harvest scheduling, known as the area restriction model (ARM). Empirical assessment of the effect of area constraints on the optimal objective value of these alternative approaches is carr ..."
Abstract
 Add to MetaCart
In this article we study the effectiveness of alternative integer programming formulations for area constrained harvest scheduling, known as the area restriction model (ARM). Empirical assessment of the effect of area constraints on the optimal objective value of these alternative approaches
An alternative formulation for a delayed . . .
, 2006
"... ... model. We provide a complete global analysis, showing that, unlike the dynamics of the classical logistic delay differential equation (DDE) model, no sustained oscillations are possible. Just as for the classical logistic ordinary differential equation (ODE) growth model, Reed (1920). Subsequent ..."
Abstract
 Add to MetaCart
). Subsequently, many researchers interested in assumed that the growth rate of one or more of the processes involved. Although a short remark in a much longer paper about circular causal systems in ecology, the formulation for the delayed logistic equation he proposed
1.2 Alternative Formulation
, 2007
"... Preliminary version — please report errors, typos, and suggestions for improvements We follow an approach similar to [1, 2]. The emphasis of this document is on a conceptual understanding. Not all statements are mathematically entirely correct, but they definitely hold for sufficiently “nice” functi ..."
Abstract
 Add to MetaCart
Preliminary version — please report errors, typos, and suggestions for improvements We follow an approach similar to [1, 2]. The emphasis of this document is on a conceptual understanding. Not all statements are mathematically entirely correct, but they definitely hold for sufficiently “nice” functions, such as the ones that are typically used in timefrequency and wavelet analysis. 1 The General Transform 1.1 Definition A useful general way of thinking of transforms is in the shape of inner products with a set of “basis” functions: where ∗ denotes the complex conjugate. Tx(γ) = 〈x(t), φγ(t)〉 (1) = x(t)φ ∗ γ(t)dt, (2) The idea here is that ‘T ’ denotes what kind of “basis ” functions are being used and γ is the index of a basis function. The basis functions are φγ(t) for all values of γ. A good way of thinking about this is that for a fixed γ, the transform coefficient Tx(γ) is the result of projecting the original signal x(t) onto the “basis ” element φγ(t). An example is the Fourier transform, where instead of the letter γ, we more often use the letter Ω, and where φΩ(t) = e jΩt. Hence, in line with the above general notation, we could write FTx(Ω) = 〈x(t), φΩ(t) 〉 (3) = x(t)e −jΩt dt, (4) Of course, we more often simply write X(Ω) (or X(jΩ)) in place of FTx(Ω).
An alternative formulation of the problem of density jump
, 1973
"... An alternative formulation of the problem of density jump, first considered by Wilkinson & Wood (1971), is presented. A first order ordinary differential equation results for the crest height of a controlling weir as 04 function of the depth of the flowing layer downsteam of the transition, wit ..."
Abstract
 Add to MetaCart
An alternative formulation of the problem of density jump, first considered by Wilkinson & Wood (1971), is presented. A first order ordinary differential equation results for the crest height of a controlling weir as 04 function of the depth of the flowing layer downsteam of the transition
Some alternative formulations of the event calculus
 Computer Science; Computational Logic; Logic programming and Beyond
, 2002
"... Abstract. The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot. In this paper we summarise how variants of the Event Calculus may be expressed as classical logic axiomatisations, and how under ce ..."
Abstract

Cited by 54 (4 self)
 Add to MetaCart
Abstract. The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot. In this paper we summarise how variants of the Event Calculus may be expressed as classical logic axiomatisations, and how under certain circumstances these theories may be reformulated as “action description language ” domain descriptions using the Language E. This enables the classical logic Event Calculus to inherit various provably correct automated reasoning procedures recently developed for E. 1
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 620 (53 self)
 Add to MetaCart
a certain state. Also the problems of receptiveness, realizability, and controllability can be formulated as modelchecking problems for alternatingtime formulas.
The ensemble Kalman Filter: Theoretical formulation and practical implementation.
 Ocean Dynamics,
, 2003
"... Abstract The purpose of this paper is to provide a comprehensive presentation and interpretation of the Ensemble Kalman Filter (EnKF) and its numerical implementation. The EnKF has a large user group and numerous publications have discussed applications and theoretical aspects of it. This paper rev ..."
Abstract

Cited by 496 (5 self)
 Add to MetaCart
reviews the important results from these studies and also presents new ideas and alternative interpretations which further explain the success of the EnKF. In addition to providing the theoretical framework needed for using the EnKF, there is also a focus on the algorithmic formulation and optimal
Alternative Formulation for the pmedian Problem
"... Given a set of clients and a set of potential sites for facilities, several location problems consist of opening a set of sites and assigning each client to the closest open facility to it. It can be viewed as a variation of the uncapacitated facility location problem. We propose a new formulation o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Given a set of clients and a set of potential sites for facilities, several location problems consist of opening a set of sites and assigning each client to the closest open facility to it. It can be viewed as a variation of the uncapacitated facility location problem. We propose a new formulation
Results 1  10
of
6,877