Results 1  10
of
485,302
A theory of communicating sequential processes
, 1984
"... A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account. ..."
Abstract

Cited by 4135 (17 self)
 Add to MetaCart
A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account.
A Comparative Evaluation of Sequential Constructive Methods
 WIRN’98  The 10th Italian Workshop on Neural Nets
"... A detailed comparison of the most promising algorithms in the class of sequential constructive methods is performed by employing artificial benchmarks and realworld problems. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A detailed comparison of the most promising algorithms in the class of sequential constructive methods is performed by employing artificial benchmarks and realworld problems.
On Sequential Construction of Binary Neural Networks
, 1995
"... A new technique, called Sequential Window Learning (SWL), for the construction of twolayer perceptrons with binary inputs is presented. ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
A new technique, called Sequential Window Learning (SWL), for the construction of twolayer perceptrons with binary inputs is presented.
SIS: A System for Sequential Circuit Synthesis
, 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential inputoutput b ..."
Abstract

Cited by 514 (41 self)
 Add to MetaCart
SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential input
On the sequential construction of optimum bounded designs
 Journal of Statistical Planning and Inference
"... We consider a parameter estimation problem with independent observations where one samples from a finite population of independent and identically distributed experimental conditions X. The size of the population is N but only n samples, a proportion α of N, can be used. The quality of a sample is m ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
is measured by a regular optimality criterion φ(·) based on the information matrix, such as the Dcriterion. The construction of an optimal approximate design bounded by µ/α, with µ the probability measure of X, can be used to construct a sampling strategy which is asymptotically optimum (when the size N
Dryad: Distributed DataParallel Programs from Sequential Building Blocks
 In EuroSys
, 2007
"... Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of availa ..."
Abstract

Cited by 730 (27 self)
 Add to MetaCart
of available computers, communicating as appropriate through files, TCP pipes, and sharedmemory FIFOs. The vertices provided by the application developer are quite simple and are usually written as sequential programs with no thread creation or locking. Concurrency arises from Dryad scheduling vertices to run
Parsing as Sequential Construction of Logical Forms
, 1999
"... In this paper we give a formal description of the parsing model that underlies the treatment of Long Distance Dependencies, Topic and Focus, Ellipsis and Quantification in, amongst others, the papers [1996],[1997], [1999a],[1998],[1999b]. In this model, a natural language string consists of a sequen ..."
Abstract
 Add to MetaCart
sequence of `instructions packages' to construct some term in a formal representation language, the logical form of the string in question. Parsing, then, is the process of executing these packages in a left to right order. Contents 1 Terms as Decorated Trees 2 2 GoalDirectedness 7 3 Actions 10 4
A Unified Approach to Sequential Constructive Methods
 WIRN’98  THE 10TH ITALIAN WORKSHOP ON NEURAL NETS
, 1998
"... A general treatment of a particular class of learning techniques for neural networks, called sequential constructive methods, is proposed. They subsequently add units to the hidden layer until all the inputoutput relations contained in a given training set are satisfied. Every addition ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A general treatment of a particular class of learning techniques for neural networks, called sequential constructive methods, is proposed. They subsequently add units to the hidden layer until all the inputoutput relations contained in a given training set are satisfied. Every addition
Lag length selection and the construction of unit root tests with good size and power
 Econometrica
, 2001
"... It is widely known that when there are errors with a movingaverage root close to −1, a high order augmented autoregression is necessary for unit root tests to have good size, but that information criteria such as the AIC and the BIC tend to select a truncation lag (k) that is very small. We conside ..."
Abstract

Cited by 534 (14 self)
 Add to MetaCart
It is widely known that when there are errors with a movingaverage root close to −1, a high order augmented autoregression is necessary for unit root tests to have good size, but that information criteria such as the AIC and the BIC tend to select a truncation lag (k) that is very small. We consider a class of Modified Information Criteria (MIC) with a penalty factor that is sample dependent. It takes into account the fact that the bias in the sum of the autoregressive coefficients is highly dependent on k and adapts to the type of deterministic components present. We use a local asymptotic framework in which the movingaverage root is local to −1 to document how the MIC performs better in selecting appropriate values of k. In montecarlo experiments, the MIC is found to yield huge size improvements to the DF GLS and the feasible point optimal PT test developed in Elliott, Rothenberg and Stock (1996). We also extend the M tests developed in Perron and Ng (1996) to allow for GLS detrending of the data. The MIC along with GLS detrended data yield a set of tests with desirable size and power properties.
Results 1  10
of
485,302