Results 1  10
of
1,166,567
Intrinsic and extrinsic motivations: Classic definitions and new directions.
 Contemporary Educational Psychology,
, 2000
"... Intrinsic and extrinsic types of motivation have been widely studied, and the distinction between them has shed important light on both developmental and educational practices. In this review we revisit the classic definitions of intrinsic and extrinsic motivation in light of contemporary research ..."
Abstract

Cited by 630 (8 self)
 Add to MetaCart
Intrinsic and extrinsic types of motivation have been widely studied, and the distinction between them has shed important light on both developmental and educational practices. In this review we revisit the classic definitions of intrinsic and extrinsic motivation in light of contemporary research
CLASSICAL STUDIES
"... The person charein ^ thic rv,.^. • , • the University. """ ^ """ " ' " dismissal from To renew co. / Telephone Center, 3338400 L161—O1096 ..."
Abstract
 Add to MetaCart
The person charein ^ thic rv,.^. • , • the University. """ ^ """ " ' " dismissal from To renew co. / Telephone Center, 3338400 L161—O1096
ALGEBRAIC GEOMETRY
"... Algebraic geometry is the mathematical study of geometric objects by means of algebra. Its origins go back to the coordinate geometry introduced by Descartes. A classic example is the circle of radius 1 in the plane, which is ..."
Abstract

Cited by 513 (6 self)
 Add to MetaCart
Algebraic geometry is the mathematical study of geometric objects by means of algebra. Its origins go back to the coordinate geometry introduced by Descartes. A classic example is the circle of radius 1 in the plane, which is
A General Theory of Equilibrium Selection in Games.
, 1988
"... Abstract This paper presents a Downsian model of political competition in which parties have incomplete but richer information than voters on policy effects. Each party can observe a private signal of the policy effects, while voters cannot. In this setting, voters infer the policy effects from the ..."
Abstract

Cited by 730 (4 self)
 Add to MetaCart
of the Median Voter Theorem in the classical Downsian model. Our equilibrium analysis suggests similarity between the set of WPBEs in this model and the set of uniformly perfect equilibria of Harsanyi and Selten (1988) in the model with completely informed parties which we studied in a previous paper
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 548 (12 self)
 Add to MetaCart
We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97
Beyond Market Baskets: Generalizing Association Rules To Dependence Rules
, 1998
"... One of the more wellstudied problems in data mining is the search for association rules in market basket data. Association rules are intended to identify patterns of the type: “A customer purchasing item A often also purchases item B. Motivated partly by the goal of generalizing beyond market bask ..."
Abstract

Cited by 634 (6 self)
 Add to MetaCart
One of the more wellstudied problems in data mining is the search for association rules in market basket data. Association rules are intended to identify patterns of the type: “A customer purchasing item A often also purchases item B. Motivated partly by the goal of generalizing beyond market
Tabu Search  Part I
, 1989
"... This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu search has achieved impressive practical successes in applications ranging from scheduling and computer channel balancing to cluster analysis and space planning, and more ..."
Abstract

Cited by 679 (11 self)
 Add to MetaCart
, and more recently has demonstrated its value in treating classical problems such as the traveling salesman and graph coloring problems. Nevertheless, the approach is still in its infancy, and a good deal remains to be discovered about its most effective forms of implementation and about the range
The Role of Emotion in Believable Agents
 Communications of the ACM
, 1994
"... Articial intelligence researchers attempting to create engaging apparently living creatures may nd important insight in the work of artists who have explored the idea of believable character In particular appropriately timed and clearly expressed emotion is a central requirement for believable ch ..."
Abstract

Cited by 557 (1 self)
 Add to MetaCart
It does not mean an honest or reliable character but one that provides the illusion of life and thus permits the audience s suspension of disbelief The idea of believability has long been studied and explored in literature theater lm radio drama and other media Traditional character animators
An Efficient Solution to the FivePoint Relative Pose Problem
, 2004
"... An efficient algorithmic solution to the classical fivepoint relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth degre ..."
Abstract

Cited by 482 (13 self)
 Add to MetaCart
An efficient algorithmic solution to the classical fivepoint relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth
Results 1  10
of
1,166,567