Results 1 - 10
of
8,782
An Empirical Study on Program Comprehension with Reactive Programming
"... ABSTRACT Starting from the first investigations with strictly functional languages, reactive programming has been proposed as THE programming paradigm for reactive applications. The advantages of designs based on this style over designs based on the Observer design pattern have been studied for a l ..."
Abstract
- Add to MetaCart
empirical study that evaluates the effect of reactive programming on comprehensibility compared to the traditional object-oriented style with the Observer design pattern. Results confirm the conjecture that comprehensibility is enhanced by reactive programming. In the experiment, the reactive programming
Application of Phylogenetic Networks in Evolutionary Studies
- SUBMITTED TO MBE 2005
, 2005
"... The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when evoluti ..."
Abstract
-
Cited by 887 (15 self)
- Add to MetaCart
a conservative statistical test for whether the conflicting signal in a network is treelike. Finally, this paper describes a new program SplitsTree4, an interactive and comprehensive tool for inferring different types of phylogenetic networks from sequences, distances and trees.
An Efficient Context-Free Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract
-
Cited by 798 (0 self)
- Add to MetaCart
; it has an n 2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths
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
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
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
and analysis; and to Gerrit Wolf for help in analytic planning. This report was prepared in connection with research supported by the Office of Naval Research (Organizational Effectiveness Research Program,, and by the Manpower Administration, U. S. Department of Labor . Since grantees conducting research
Empirical tests of the Gradual Learning Algorithm
- LINGUISTIC INQUIRY 32.45–86
, 2001
"... The Gradual Learning Algorithm (Boersma 1997) is a constraint ranking algorithm for learning Optimality-theoretic grammars. The purpose of this article is to assess the capabilities of the Gradual Learning Algorithm, particularly in comparison with the Constraint Demotion algorithm of Tesar and Smol ..."
Abstract
-
Cited by 383 (37 self)
- Add to MetaCart
and Smolensky (1993, 1996, 1998, 2000), which initiated the learnability research program for Optimality Theory. We argue that the Gradual Learning Algorithm has a number of special advantages: it can learn free variation, deal effectively with noisy learning data, and account for gradient wellformedness
Evolutionary Programming Made Faster
- IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
, 1999
"... Evolutionary programming (EP) has been applied with success to many numerical and combinatorial optimization problems in recent years. EP has rather slow convergence rates, however, on some function optimization problems. In this paper, a "fast EP" (FEP) is proposed which uses a Cauchy ins ..."
Abstract
-
Cited by 343 (40 self)
- Add to MetaCart
instead of Gaussian mutation as the primary search operator. The relationship between FEP and classical EP (CEP) is similar to that between fast simulated annealing and the classical version. Both analytical and empirical studies have been carried out to evaluate the performance of FEP and CEP
Automatic Programming of Behavior-based Robots using Reinforcement Learning
, 1991
"... This paper describes a general approach for automatically programming a behavior-based robot. New behaviors are learned by trial and error using a performance feedback function as reinforcement. Two algorithms for behavior learning are described that combine Q learning, a well known scheme for propa ..."
Abstract
-
Cited by 368 (17 self)
- Add to MetaCart
handcoded program. Two, using a behavior-based architecture speeds up reinforcement learning by converting the problem of learning a complex task into that of learning a simpler set of special-purpose reactive subtasks.
Toward a Conceptual Framework for Mixed-Method Evaluation Designs. Educational Evaluation and Policy Analysis
, 1989
"... In recent years evaluators of educational and social programs have expanded their method-ological repertoire with designs that include the use of both qualitative and quantitative methods. Such practice, however, needs to be grounded in a theory that can meaningfully guide the design and implementat ..."
Abstract
-
Cited by 404 (3 self)
- Add to MetaCart
and implementation of mixed-method evaluations. In this study, a mixed-method conceptual framework was developed from the theoretical literature and then refined through an analysis of 57 empirical mixed-method evaluations. Five purposes for mixed-method evaluations are identified in this conceptual framework
An Empirical Study of the Reliability of UNIX Utilities
- In Proceedings of the Workshop of Parallel and Distributed Debugging
, 1990
"... This report describes these tests and an analysis of the program bugs that caused the crashes. Content Indicators D.2.5 (Testing and Debugging), D.4.9 (Programs and Utilities), General term: reliability, UNIX. #################################### ..."
Abstract
-
Cited by 292 (5 self)
- Add to MetaCart
This report describes these tests and an analysis of the program bugs that caused the crashes. Content Indicators D.2.5 (Testing and Debugging), D.4.9 (Programs and Utilities), General term: reliability, UNIX. ####################################
Results 1 - 10
of
8,782