Results 1 - 10 of 35,431

Analytic Analysis of Algorithms

by Philippe Flajolet , 1992
"... . The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis. Symbolic methods in combinatorial analysis permit to express directly the counting generating functions of wide classes of combinatorial struct ..."
Abstract - Cited by 331 (13 self) - Add to MetaCart
. The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis. Symbolic methods in combinatorial analysis permit to express directly the counting generating functions of wide classes of combinatorial

A Meta-Analytic Review of Experiments Examining the Effects of Extrinsic Rewards on Intrinsic Motivation

by Edward L. Deci, Richard Koestner, Richard M. Ryan
"... A meta-analysis of 128 studies examined the effects of extrinsic rewards on intrinsic motivation. As predicted, engagement-contingent, completion-contingent, and performance-contingent rewards signifi-cantly undermined free-choice intrinsic motivation (d =-0.40,-0.36, and-0.28, respectively), as did ..."
Abstract - Cited by 664 (18 self) - Add to MetaCart
A meta-analysis of 128 studies examined the effects of extrinsic rewards on intrinsic motivation. As predicted, engagement-contingent, completion-contingent, and performance-contingent rewards signifi-cantly undermined free-choice intrinsic motivation (d =-0.40,-0.36, and-0.28, respectively

Three approaches to qualitative content analysis.

by Hsiu-Fang Hsieh , Sarah E Shannon , 2005
"... Content analysis is a widely used qualitative Researchers regard content analysis as a flexible method for analyzing text data The differentiation of content analysis is usually limited to classifying it as primarily a qualitative versus quantitative research method. A more thorough analysis of th ..."
Abstract - Cited by 729 (0 self) - Add to MetaCart
and support in writing this article. QUALITATIVE HEALTH RESEARCH, Vol. 15 No. 9, November 2005 1277-1288 DOI: 10.1177/1049732305276687 © 2005 use content analysis and the analytic procedures employed in such studies, thus avoiding a muddling of methods Our purpose in this article is to present the breadth

Transform Analysis and Asset Pricing for Affine Jump-Diffusions

by Darrell Duffie, Jun Pan, Kenneth Singleton - Econometrica , 2000
"... In the setting of ‘‘affine’ ’ jump-diffusion state processes, this paper provides an analytical treatment of a class of transforms, including various Laplace and Fourier transforms as special cases, that allow an analytical treatment of a range of valuation and econometric problems. Example applicat ..."
Abstract - Cited by 710 (38 self) - Add to MetaCart
In the setting of ‘‘affine’ ’ jump-diffusion state processes, this paper provides an analytical treatment of a class of transforms, including various Laplace and Fourier transforms as special cases, that allow an analytical treatment of a range of valuation and econometric problems. Example

Evaluating the use of exploratory factor analysis in psychological research

by Leandre R. Fabrigar, Duane T. Wegener, Robert C. MacCallum, Erin J. Strahan - PSYCHOLOGICAL METHODS , 1999
"... Despite the widespread use of exploratory factor analysis in psychological research, researchers often make questionable decisions when conducting these analyses. This article reviews the major design and analytical decisions that must be made when conducting a factor analysis and notes that each of ..."
Abstract - Cited by 524 (4 self) - Add to MetaCart
Despite the widespread use of exploratory factor analysis in psychological research, researchers often make questionable decisions when conducting these analyses. This article reviews the major design and analytical decisions that must be made when conducting a factor analysis and notes that each

A comparative analysis of selection schemes used in genetic algorithms

by David E. Goldberg, Kalyanmoy Deb - Foundations of Genetic Algorithms , 1991
"... This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference or d ..."
Abstract - Cited by 531 (31 self) - Add to MetaCart
or differential equations, which are verified through computer simulations. The analysis provides convenient approximate or exact solutions as well as useful convergence time and growth ratio estimates. The paper recommends practical application of the analyses and suggests a number of paths for more detailed

Performance Analysis of the IEEE 802.11 Distributed Coordination Function

by Giuseppe Bianchi , 2000
"... Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slott ..."
Abstract - Cited by 1869 (1 self) - Add to MetaCart
slotted exponential backoff. This paper provides a simple, but nevertheless extremely accurate, analytical model to compute the 802.11 DCF throughput, in the assumption of finite number of terminals and ideal channel conditions. The proposed analysis applies to both the packet transmission schemes

Singular Combinatorics

by Philippe Flajolet - ICM 2002 VOL. III 1-3 , 2002
"... Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit probability distributions present in large random structures. " ..."
Abstract - Cited by 800 (10 self) - Add to MetaCart
. "Singularity analysis" reviewed here provides constructive estimates that are applicable in several areas of combinatorics. It constitutes a complex-analytic Tauberian procedure by which combinatorial constructions and asymptotic-probabilistic laws can be systematically related.

LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

by Christopher C. Paige, Michael A. Saunders - ACM Trans. Math. Software , 1982
"... An iterative method is given for solving Ax ~ffi b and minU Ax- b 112, where the matrix A is large and sparse. The method is based on the bidiagonalization procedure of Golub and Kahan. It is analytically equivalent to the standard method of conjugate gradients, but possesses more favorable numerica ..."
Abstract - Cited by 653 (21 self) - Add to MetaCart
An iterative method is given for solving Ax ~ffi b and minU Ax- b 112, where the matrix A is large and sparse. The method is based on the bidiagonalization procedure of Golub and Kahan. It is analytically equivalent to the standard method of conjugate gradients, but possesses more favorable

Consensus Problems in Networks of Agents with Switching Topology and Time-Delays

by Reza Olfati Saber, Richard M. Murray , 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or leader ..."
Abstract - Cited by 1112 (21 self) - Add to MetaCart
in convergence analysis of consensus protocols. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate
Results 1 - 10 of 35,431