Results 1  10
of
673,880
A comparative analysis of selection schemes used in genetic algorithms
 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 528 (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
Policy gradient methods for reinforcement learning with function approximation.
 In NIPS,
, 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract

Cited by 437 (20 self)
 Add to MetaCart
. Marbach and Tsitsiklis (1998) describe a related but different expression for the gradient in terms of the statevalue function, citing Jaakkola, ∂θ : the effect of policy changes on the distribution of states does not appear. This is convenient for approximating the gradient by sampling. For example
Network Time Protocol (Version 3) Specification, Implementation and Analysis
, 1992
"... Note: This document consists of an approximate rendering in ASCII of the PostScript document of the same name. It is provided for convenience and for use in searches, etc. However, most tables, figures, equations and captions have not been rendered and the pagination and section headings are not ava ..."
Abstract

Cited by 522 (18 self)
 Add to MetaCart
Note: This document consists of an approximate rendering in ASCII of the PostScript document of the same name. It is provided for convenience and for use in searches, etc. However, most tables, figures, equations and captions have not been rendered and the pagination and section headings
On Language and Connectionism: Analysis of a Parallel Distributed Processing Model of Language Acquisition
 COGNITION
, 1988
"... Does knowledge of language consist of mentallyrepresented rules? Rumelhart and McClelland have described a connectionist (parallel distributed processing) model of the acquisition of the past tense in English which successfully maps many stems onto their past tense forms, both regular (walk/walked) ..."
Abstract

Cited by 415 (13 self)
 Add to MetaCart
form, and an array of connections between the two sets of units whose strengths are modified during learning. Rumelhart and McClelland conclude that linguistic rules may be merely convenient approximate fictions and that the real causal processes in language use and acquisition must be characterized
A Convenient Approximation of Transverse Isotropy for HigherOrder Moveout, Prestack Time Migration, and Depth Calibration
"... this paper. REFERENCES ..."
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
, 1993
"... We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximated in Euclidian space, or where the dimensionality of a Euclidian representation is very high. Also relevant are highdim ..."
Abstract

Cited by 357 (5 self)
 Add to MetaCart
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximated in Euclidian space, or where the dimensionality of a Euclidian representation is very high. Also relevant are high
Practical conebeam algorithm
 J Opt Soc Am
, 1984
"... A convolutionbackprojection formula is deduced for direct reconstruction of a threedimensional density function from a set of twodimensional projections. The formula is approximate but has useful properties, including errors that are relatively small in many practical instances and a form that le ..."
Abstract

Cited by 308 (0 self)
 Add to MetaCart
A convolutionbackprojection formula is deduced for direct reconstruction of a threedimensional density function from a set of twodimensional projections. The formula is approximate but has useful properties, including errors that are relatively small in many practical instances and a form
Nonoscillatory central differencing for hyperbolic conservation laws
 J. COMPUT. PHYS
, 1990
"... Many of the recently developed highresolution schemes for hyperbolic conservation laws are based on upwind differencing. The building block of these schemes is the averaging of an approximate Godunov solver; its time consuming part involves the fieldbyfield decomposition which is required in orde ..."
Abstract

Cited by 298 (25 self)
 Add to MetaCart
Many of the recently developed highresolution schemes for hyperbolic conservation laws are based on upwind differencing. The building block of these schemes is the averaging of an approximate Godunov solver; its time consuming part involves the fieldbyfield decomposition which is required
Agrep  A Fast Approximate PatternMatching Tool
 In Proc. of USENIX Technical Conference
, 1992
"... Searching for a pattern in a text file is a very common operation in many applications ranging from text editors and databases to applications in molecular biology. In many instances the pattern does not appear in the text exactly. Errors in the text or in the query can result from misspelling or fr ..."
Abstract

Cited by 161 (6 self)
 Add to MetaCart
or from experimental errors (e.g., when the text is a DNA sequence). The use of such approximate pattern matching has been limited until now to specific applications. Most text editors and searching programs do not support searching with errors because of the complexity involved in implementing it
APPROXIMATION
"... Abstract. We provide a nitedimensional model of the twisted Kgroup twisted by any degree three integral cohomology class of a CW complex. One key to the model is Furuta's generalized vector bundle, and the other is a nitedimensional approximation of Fredholm operators. 1. ..."
Abstract
 Add to MetaCart
Abstract. We provide a nitedimensional model of the twisted Kgroup twisted by any degree three integral cohomology class of a CW complex. One key to the model is Furuta's generalized vector bundle, and the other is a nitedimensional approximation of Fredholm operators. 1.
Results 1  10
of
673,880