• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 10,571
Next 10 →

Modular elliptic curves and Fermat’s Last Theorem

by Andrew John Wiles - ANNALS OF MATH , 1995
"... When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided that he would be the first person to prove Fermat’s Last Theorem. This theorem states that there are no nonzero integers a, b, c, n with n> 2 such that a n + b n = c n ..."
Abstract - Cited by 617 (2 self) - Add to MetaCart
n. The object of this paper is to prove that all semistable elliptic curves over the set of rational numbers are modular. Fermat’s Last Theorem follows as a corollary by virtue of previous work by Frey, Serre and Ribet.

Strategy-Proofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions

by Mark Allen Satterthwaite - J. Econ. Theory , 1975
"... Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategy-proof if it always induces every committee member to cast a ballot revealing his preference. I pro ..."
Abstract - Cited by 553 (0 self) - Add to MetaCart
prove three theorems. First, every strategy-proof voting procedure is dictatorial. Second, this paper’s strategy-proofness condition for voting procedures corre-sponds to Arrow’s rationality, independence of irrelevant alternatives, non-negative response, and citizens ’ sovereignty conditions for social

An axiomatic basis for computer programming

by C. A. R. Hoare - COMMUNICATIONS OF THE ACM , 1969
"... In this paper an attempt is made to explore the logical founda-tions of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This in-volves the elucidation of sets of axioms and rules of inference w ..."
Abstract - Cited by 1754 (4 self) - Add to MetaCart
which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and prac-tical, may follow from a pursuance of these topics.

The irreducibility of the space of curves of given genus

by P. Deligne, D. Mumford - Publ. Math. IHES , 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~- ..."
Abstract - Cited by 506 (2 self) - Add to MetaCart
approach however is closest to Severi's incomplete proof ([Se], Anhang F; the error is on pp. 344-345 and seems to be quite basic) and follows a suggestion of Grothendieck for using the result in char. o to deduce the result in char. p. The basis of both Severi's and Grothendieck's ideas

Partial Functions

by Czes Law Byli'nski
"... this article we prove some auxiliary theorems and schemes related to the articles: [1] and [2]. MML Identifier: PARTFUN1. WWW: http://mizar.org/JFM/Vol1/partfun1.html The articles [4], [6], [3], [5], [7], [8], and [1] provide the notation and terminology for this paper. We adopt the following rules ..."
Abstract - Cited by 492 (10 self) - Add to MetaCart
this article we prove some auxiliary theorems and schemes related to the articles: [1] and [2]. MML Identifier: PARTFUN1. WWW: http://mizar.org/JFM/Vol1/partfun1.html The articles [4], [6], [3], [5], [7], [8], and [1] provide the notation and terminology for this paper. We adopt the following

Loopy belief propagation for approximate inference: An empirical study. In:

by Kevin P Murphy , Yair Weiss , Michael I Jordan - Proceedings of Uncertainty in AI, , 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract - Cited by 676 (15 self) - Add to MetaCart
tiply connected networks: When loops are present, the network is no longer singly connected and local propaga tion schemes will invariably run into trouble . We believe there are general undiscovered theorems about the performance of belief propagation on loopy DAGs. These theo rems, which may have

The aim of this note is to prove the following theorem.

by David Meintrup, Thomas Schick
"... Abstract. Let G be a word hyperbolic group in the sense of Gromov and P its associated Rips complex. We prove that the fixed point set P H iscontractible for every finite subgroup H of G. Thisisthe main ingredient for proving that P is a finite model for the universal space EG for proper actions. As ..."
Abstract - Add to MetaCart
Abstract. Let G be a word hyperbolic group in the sense of Gromov and P its associated Rips complex. We prove that the fixed point set P H iscontractible for every finite subgroup H of G. Thisisthe main ingredient for proving that P is a finite model for the universal space EG for proper actions. As a corollary we get that a hyperbolic group hasonly finitely many conjugacy classes of finite subgroups.

HOMOGENIZATION AND TWO-SCALE CONVERGENCE

by Gregoire Allaire , 1992
"... Following an idea of G. Nguetseng, the author defines a notion of "two-scale" convergence, which is aimed at a better description of sequences of oscillating functions. Bounded sequences in L2(f) are proven to be relatively compact with respect to this new type of convergence. A corrector- ..."
Abstract - Cited by 451 (14 self) - Add to MetaCart
Following an idea of G. Nguetseng, the author defines a notion of "two-scale" convergence, which is aimed at a better description of sequences of oscillating functions. Bounded sequences in L2(f) are proven to be relatively compact with respect to this new type of convergence. A corrector

Policy gradient methods for reinforcement learning with function approximation.

by Richard S Sutton , David Mcallester , Satinder Singh , Yishay Mansour - 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 439 (20 self) - Add to MetaCart
at s 0 and then following π: d π (s) = ∞ t=0 γ t P r {s t = s|s 0 , π}. Our first result concerns the gradient of the performance metric with respect to the policy parameter: Theorem 1 (Policy Gradient). For any MDP, in either the average-reward or start-state formulations, Proof: See the appendix

The following theorem is well-known from linear algebra.

by unknown authors , 2009
"... ..."
Abstract - Add to MetaCart
Abstract not found
Next 10 →
Results 1 - 10 of 10,571
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University