computer science
sort by: Relevancy | Title try advanced search for more options
-
Applications of Reinforcement Learning, Markov Decision Process (MDP), Defining Value & Policy Functions, Value Function, Optimal Value Function, Value Iteration, Policy Iteration
-
August 3, 2006 presentation by Uwe Bergmann for the Stanford University Office of Science Outreach's Summer Science Lecture Series. Uwe Bergman, Physicist at the Stanford Linear Accelerator takes the viewer on a journey of a 1,000 year old parchment from its origin in the Mediterranean city of Constantinople to a particle accelerator in Menlo Park.
-
The lecture begins with an introduction of Aristotle's life and works which constitute thematic treatises on virtually every topic, from biology to ethics to politics. Emphasis is placed on the Politics, in which Aristotle expounds his view on the naturalness of the city and his claim that man is a political animal by nature.
-
The lecture discusses Aristotle's comparative politics with a special emphasis on the idea of the regime, as expressed in books III through VI in Politics. A regime, in the context of this major work, refers to both the formal enumeration of rights and duties within a community as well as to the distinctive customs, manners, moral dispositions and sentiments of that community. Aristotle asserts that it is precisely the regime that gives a ...more
-
This final lecture on Aristotle focuses on controlling conflict between factions. Polity as a mixture of the principles of oligarchy and democracy, is the regime that, according to Aristotle, can most successfully control factions and avoid dominance by either extreme. Professor Smith asserts that the idea of the polity anticipates Madison's call for a government in which powers are separated and kept in check and balance, avoiding therefo...more
-
Array, Creating a New Array, The ++ Operator, Actual Size / Effective Size of the Array, An Array as a Parameter, Initialize an Array During Creation, An ArrayList
-
-
-
We discuss auctions. We first distinguish two extremes: common values and private values. We hold a common value auction in class and discover the winner's curse, the winner tends to overpay. We discuss why this occurs and how to avoid it: you should bid as if you knew that your bid would win; that is, as if you knew your initial estimate of the common value was the highest. This leads you to bid much below your initial estimate. Then we d...more
-
We look at two settings with asymmetric information; one side of a game knows something that the other side does not. We should always interpret attempts to communicate or signal such information taking into account the incentives of the person doing the signaling. In the first setting, information is verifiable. Here, the failure explicitly to reveal information can be informative, and hence verifiable information tends to come out even w...more
-
Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.
-
