Results 1  10
of
463,130
Reasoning the fast and frugal way: Models of bounded rationality.
 Psychological Review,
, 1996
"... Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors have ..."
Abstract

Cited by 609 (30 self)
 Add to MetaCart
Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors
Affective Computing
, 1995
"... Recent neurological studies indicate that the role of emotion in human cognition is essential; emotions are not a luxury. Instead, emotions play a critical role in rational decisionmaking, in perception, in human interaction, and in human intelligence. These facts, combined with abilities computers ..."
Abstract

Cited by 1907 (43 self)
 Add to MetaCart
Recent neurological studies indicate that the role of emotion in human cognition is essential; emotions are not a luxury. Instead, emotions play a critical role in rational decisionmaking, in perception, in human interaction, and in human intelligence. These facts, combined with abilities
REVIEW Computational rationality: A
"... converging paradigm for intelligence in brains, minds, and machines Samuel J. Gershman,1 * Eric J. Horvitz,2 * Joshua B. Tenenbaum3* After growing up together, and mostly growing apart in the second half of the 20th century, the fields of artificial intelligence (AI), cognitive science, and neurosci ..."
Abstract
 Add to MetaCart
of computational rationality: identifying decisions with highest expected utility, while taking into consideration the costs of computation in complex realworld problems in which most relevant calculations can only be approximated.We highlight key concepts with
Computing Rational Points on Curves
 In Number theory for the millennium, III (Urbana, IL, 2000), 149–172, A K Peters
, 2000
"... We give a brief introduction to the problem of explicit determination of rational points on curves, indicating some recent ideas that have led to progress. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We give a brief introduction to the problem of explicit determination of rational points on curves, indicating some recent ideas that have led to progress.
BDI Agents: From Theory to Practice
 IN PROCEEDINGS OF THE FIRST INTERNATIONAL CONFERENCE ON MULTIAGENT SYSTEMS (ICMAS95
, 1995
"... The study of computational agents capable of rational behaviour has received a great deal of attention in recent years. Theoretical formalizations of such agents and their implementations have proceeded in parallel with little or no connection between them. This paper explores a particular typ ..."
Abstract

Cited by 890 (3 self)
 Add to MetaCart
The study of computational agents capable of rational behaviour has received a great deal of attention in recent years. Theoretical formalizations of such agents and their implementations have proceeded in parallel with little or no connection between them. This paper explores a particular
Epidemic Spreading in ScaleFree Networks
, 2000
"... The Internet, as well as many other networks, has a very complex connectivity recently modeled by the class of scalefree networks. This feature, which appears to be very efficient for a communications network, favors at the same time the spreading of computer viruses. We analyze real data from c ..."
Abstract

Cited by 572 (15 self)
 Add to MetaCart
framework rationalize data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks. PACS numbers: 05.70.Ln, 05.50.+q Typeset using REVT E X 1 Many social, biological, and communication systems can be properly described by complex
Computing rational parametrizations of canal surfaces
 Journal of Symbolic Computation
, 1997
"... A canal surface is the envelope of a oneparameter set of spheres with radii r(t) and centers m(t). It is shown that any canal surface to a rational spine curve m(t) and a rational radius function r(t) possesses rational parametrizations. We derive algorithms for the computation of these parametriza ..."
Abstract

Cited by 32 (7 self)
 Add to MetaCart
A canal surface is the envelope of a oneparameter set of spheres with radii r(t) and centers m(t). It is shown that any canal surface to a rational spine curve m(t) and a rational radius function r(t) possesses rational parametrizations. We derive algorithms for the computation
Computing Rational Forms of Integer Matrices
 J. Symbolic Comput
, 2000
"... A new algorithm is presented for nding the Frobenius rational form F 2 Z nn of any A 2 Z nn which requires an expected O(n 4 (log n+log kAk)+n 3 (log n+log kAk) 2 ) word operations using standard integer and matrix arithmetic. This improves substantially on the fastest previously known alg ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
algorithms. The algorithm is probabilistic of the Las Vegas type: it assumes a source of random bits but always produces the correct answer. Las Vegas algorithms are also presented for computing a transformation matrix to the Frobenius form, and for computing the rational Jordan form of an integer matrix. 1
Computational Rationalization: The Inverse Equilibrium Problem
"... Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task. When restricted to the singleagent decisiontheoretic setting, inverse optimal control techniques assume that observed behavior is an approximately optimal solution to an unknown decision ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task. When restricted to the singleagent decisiontheoretic setting, inverse optimal control techniques assume that observed behavior is an approximately optimal solution to an unknown decision problem. These techniques learn a utility function that explains the example behavior and can then be used to accurately predict or imitate future behavior in similar observed or unobserved situations. In this work, we consider similar tasks in competitive and cooperative multiagent domains. Here, unlike singleagent settings, a player cannot myopically maximize its reward — it must speculate on how the other agents may act to influence the game’s outcome. Employing the gametheoretic notion of regret and the principle of maximum entropy, we introduce a technique for predicting and generalizing behavior, as well as recovering a reward function in these domains. 1.
On computing rational torsion on elliptic curves
"... We introduce an ladic algorithm to efficiently determine the group of rational torsion points on an elliptic curve. We also make a conjecture about the discriminant of the mdivision polynomial of an elliptic curve. 1. ..."
Abstract
 Add to MetaCart
We introduce an ladic algorithm to efficiently determine the group of rational torsion points on an elliptic curve. We also make a conjecture about the discriminant of the mdivision polynomial of an elliptic curve. 1.
Results 1  10
of
463,130