Results 1 - 10 of 3,434

Technological pedagogical content knowledge: A framework for integrating technology in teacher knowledge.

by M J Koehler , P Mishra - Teachers College Record, , 2006
"... Abstract This paper describes a framework for teacher knowledge for technology integration called technological pedagogical content knowledge (originally TPCK, now known as TPACK, or technology, pedagogy, and content knowledge). This framework builds on Lee Shulman's construct of pedagogical c ..."
Abstract - Cited by 420 (19 self) - Add to MetaCart
properties that make applying them in straightforward ways difficult. Most traditional pedagogical technologies are characterized by specificity (a pencil is for writing, while a microscope is for viewing small objects); stability (pencils, pendulums, and chalkboards have not changed a great deal over time

An Analysis of First-Order Logics of Probability

by Joseph Y. Halpern - Artificial Intelligence , 1990
"... : We consider two approaches to giving semantics to first-order logics of probability. The first approach puts a probability on the domain, and is appropriate for giving semantics to formulas involving statistical information such as "The probability that a randomly chosen bird flies is greater ..."
Abstract - Cited by 314 (17 self) - Add to MetaCart
combined, allowing us to reason in a straightforward way about statistical information and degrees of belief. We then consider axiomatizing these logics. In general, it can be shown that no complete axiomatization is possible. We provide axiom systems that are sound and complete in cases where a complete

Motivated Reinforcement Learning

by Peter Dayan , 2001
"... The standard reinforcement learning view of the involvement of neuromodulatory systems in instrumental conditioning includes a rather straightforward conception of motivation as prediction of sum future reward. Competition between actions is based on the motivating characteristics of their consequen ..."
Abstract - Cited by 332 (15 self) - Add to MetaCart
The standard reinforcement learning view of the involvement of neuromodulatory systems in instrumental conditioning includes a rather straightforward conception of motivation as prediction of sum future reward. Competition between actions is based on the motivating characteristics

A BGP-based Mechanism for Lowest-Cost Routing

by Joan Feigenbaum, Christos Papadimitriou, Rahul Sami, Scott Shenker , 2002
"... The routing of traffic between... this paper, we address the problem of interdomain routing from a mechanism-design point of view. The application of mechanism-design principles to the study of routing is the subject of earlier work by Nisan and Ronen [15] and Hershberger and Suri [11]. In this pape ..."
Abstract - Cited by 268 (16 self) - Add to MetaCart
]. In this paper, we formulate and solve a version of the routing-mechanism design problem that is different from the previously studied version in three ways that make it more accurately reflective of real-world interdomain routing: (1) we treat the nodes as strategic agents, rather than the links; (2) our

Smallest Enclosing Disks (balls and Ellipsoids)

by Emo Welzl - Results and New Trends in Computer Science , 1991
"... A simple randomized algorithm is developed which computes the smallest enclosing disk of a finite set of points in the plane in expected linear time. The algorithm is based on Seidel's recent Linear Programming algorithm, and it can be generalized to computing smallest enclosing balls or ellips ..."
Abstract - Cited by 209 (5 self) - Add to MetaCart
or ellipsoids of point sets in higher dimensions in a straightforward way. Experimental results of an implementation are presented. 1 Introduction During the recent years randomized algorithms have been developed for a host of problems in computational geometry. Many of these algorithms are not only attractive

Straightforward Feature Selection for Scalable Latent Semantic Indexing

by Jun Yan, Shuicheng Yan, Ning Liu, Zheng Chen
"... Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large scale text corpus due to its high computational complexity. In this paper, we propose a straightforward feature selection st ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large scale text corpus due to its high computational complexity. In this paper, we propose a straightforward feature selection

A general algorithm for calculating jet cross sections in

by S. Catani - NLO QCD,” Nucl. Phys. B , 1997
"... We present a new general algorithm for calculating arbitrary jet cross sections in arbitrary scattering processes to next-to-leading accuracy in perturbative QCD. The algorithm is based on the subtraction method. The key ingredients are new factorization formulae, called dipole formulae, which imple ..."
Abstract - Cited by 195 (3 self) - Add to MetaCart
implement in a Lorentz covariant way both the usual soft and collinear approximations, smoothly interpolating the two. The corresponding dipole phase space obeys exact factorization, so that the dipole contributions to the cross section can be exactly integrated analytically over the whole of phase space

Time-Changed Lévy Processes and Option Pricing

by Peter Carr , Liuren Wu , 2002
"... As is well known, the classic Black-Scholes option pricing model assumes that returns follow Brownian motion. It is widely recognized that return processes differ from this benchmark in at least three important ways. First, asset prices jump, leading to non-normal return innovations. Second, return ..."
Abstract - Cited by 189 (23 self) - Add to MetaCart
As is well known, the classic Black-Scholes option pricing model assumes that returns follow Brownian motion. It is widely recognized that return processes differ from this benchmark in at least three important ways. First, asset prices jump, leading to non-normal return innovations. Second, return

Optimistic parallelism requires abstractions

by Milind Kulkarni, Keshav Pingali - In PLDI , 2007
"... Irregular applications, which manipulate large, pointer-based data structures like graphs, are difficult to parallelize manually. Automatic tools and techniques such as restructuring compilers and runtime speculative execution have failed to uncover much parallelism in these applications, in spite o ..."
Abstract - Cited by 179 (24 self) - Add to MetaCart
) assertions about methods in class libraries, and (3) a runtime scheme for detecting and recovering from potentially unsafe accesses to shared memory made by an optimistic computation. We show that Delaunay mesh generation and agglomerative clustering can be parallelized in a straight-forward way using

Straightforward Bibliography Managament in R Using the RefManageR Package

by Mathew W. Mclean
"... This work introduces the R package RefManageR, which provides tools for importing and working with bibliographic references. It extends the bibentry class in R in a number of useful ways, including providing R with previously unavailable support for BIBLATEX. BIBLATEX provides a superset of the func ..."
Abstract - Add to MetaCart
This work introduces the R package RefManageR, which provides tools for importing and working with bibliographic references. It extends the bibentry class in R in a number of useful ways, including providing R with previously unavailable support for BIBLATEX. BIBLATEX provides a superset
Results 1 - 10 of 3,434