Note on Approximate Evolution

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on approximate Bayesian bootstrap imputation

The approximate Bayesian bootstrap is suggested by Rubin & Schenker (1986) as a way of generating multiple imputations when the original sample can be regarded as independently and identically distributed and the response mechanism is ignorable. We investigate the finite sample properties of the variance estimator when the approximate Bayesian bootstrap method is used and show that the bias is ...

متن کامل

A Note on Approximate Nearest Neighbor Methods

The references (e.g., Indyk and Motwani, 1999, Datar et al., 2004) contain extensive discussions of the complexity and applications of nearest neighbor algorithms and the motivations for introducing approximations. Complexity does not directly concern us in this paper, so we will not discuss it further; this paper is concerned with the utility and implications of the approximation scheme chosen...

متن کامل

A Note on Approximate Nash Equilibria

In view of the intractability of finding a Nash equilibrium, it is important to understand the limits of approximation in this context. A subexponential approximation scheme is known [LMM03], and no approximation better than 1 4 is possible by any algorithm that examines equilibria involving fewer than logn strategies [Alt94]. We give a simple, linear-time algorithm examining just two strategie...

متن کامل

A Note on Approximate Convex Hulls

Bentley, Faust and Preparata [1] presented a linear time algorithm for computing an approximate convex hull in two-dimensional space. They compute a polygon with vertices in the given set of points in the plane such that the polygon is arbitrarily close to the convex hull of the point set. Soisalon-Soininen [2] modified the approximation scheme of [1] and, among other things, gave a criterion w...

متن کامل

A Note on Approximate Linear Programming

M Serna recently proved that approximating linear programming is log space complete for P This note shows a direct reduction of the exact problem to Serna s approximate one Consider the problem given A Z n and b Z decide whether D fx QjAx b x g If D then there exists an x D such that x e where L is the length of the input and e T Z see e g Consider the problem P Maximize t subject to Ax t b x t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the London Mathematical Society

سال: 1891

ISSN: 0024-6115,1460-244X

DOI: 10.1112/plms/s1-23.1.295