Results 11  20
of
2,250,884
Combining Branch Predictors
, 1993
"... One of the key factors determining computer performance is the degree to which the implementation can take advantage of instructionlevel parallelism. Perhaps the most critical limit to this parallelism is the presence of conditional branches that determine which instructions need to be executed ne ..."
Abstract

Cited by 628 (0 self)
 Add to MetaCart
of branch history by hashing it together with the branch address. Together, these new techniques are shown to outperform previously known approaches both in terms of maximum prediction accuracy and the prediction accuracy for a given predictor size. Specifically, prediction accuracy reaches 98.1% correct
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems
, 1992
"... We introduce the framework of hybrid automata as a model and specification language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior of variables is governed in each state by a set of differential equations. We show that many of the examp ..."
Abstract

Cited by 456 (20 self)
 Add to MetaCart
We introduce the framework of hybrid automata as a model and specification language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior of variables is governed in each state by a set of differential equations. We show that many
Strongly Elliptic Systems and Boundary Integral Equations
, 2000
"... Partial differential equations provide mathematical models of many important problems in the physical sciences and engineering. This book treats one class of such equations, concentrating on methods involving the use of surface potentials. It provides the first detailed exposition of the mathematic ..."
Abstract

Cited by 492 (0 self)
 Add to MetaCart
of the mathematical theory of boundary integral equations of the first kind on nonsmooth domains. Included are chapters on three specific examples: the Laplace equation, the Helmholtz equation and the equations of linear elasticity. The book is designed to provide an ideal preparation for studying the modern
Mining Specifications
, 2002
"... Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally describe correct behavior or errors is a major barrier to the widespread adoption of program verification, since program ..."
Abstract

Cited by 359 (6 self)
 Add to MetaCart
Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally describe correct behavior or errors is a major barrier to the widespread adoption of program verification, since
Shared memory consistency models: A tutorial
 IEEE Computer
, 1996
"... Parallel systems that support the shared memory abstraction are becoming widely accepted in many areas of computing. Writing correct and efficient programs for such systems requires a formal specification of memory semantics, called a memory consistency model. The most intuitive modelâ€”sequential con ..."
Abstract

Cited by 432 (10 self)
 Add to MetaCart
Parallel systems that support the shared memory abstraction are becoming widely accepted in many areas of computing. Writing correct and efficient programs for such systems requires a formal specification of memory semantics, called a memory consistency model. The most intuitive model
InformationBased Objective Functions for Active Data Selection
 Neural Computation
"... Learning can be made more efficient if we can actively select particularly salient data points. Within a Bayesian learning framework, objective functions are discussed which measure the expected informativeness of candidate measurements. Three alternative specifications of what we want to gain infor ..."
Abstract

Cited by 419 (4 self)
 Add to MetaCart
Learning can be made more efficient if we can actively select particularly salient data points. Within a Bayesian learning framework, objective functions are discussed which measure the expected informativeness of candidate measurements. Three alternative specifications of what we want to gain
The Retinoblastoma Protein and CellCycle Control
 Cell
, 1995
"... pRB, the product of the retinoblastoma tumor suppressor gene, operates in the midst of the cell cycle clock apparatus. Its main role is to act as a signal transducer connecting the cell cycle clock with the transcriptional machinery. In this role, pRB allows the clock to control the expression of b ..."
Abstract

Cited by 422 (4 self)
 Add to MetaCart
pRB, the product of the retinoblastoma tumor suppressor gene, operates in the midst of the cell cycle clock apparatus. Its main role is to act as a signal transducer connecting the cell cycle clock with the transcriptional machinery. In this role, pRB allows the clock to control the expression of banks of genes that mediate advance of the cell through a critical phase of its growth cycle. Loss of pRB function deprives the clock and thus the cell of an important mechanism for braking cell proliferation through modulation of gene expression. pRB and the G1 Restriction Point pRB exerts most and perhaps all of its effects in a defined window of time in the first two thirds of the G1 phase of the cell cycle. As demonstrated by Pardee almost two decades ago, this is the time window during which the mam
Surface Reconstruction by Voronoi Filtering
 Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract

Cited by 405 (13 self)
 Add to MetaCart
We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled
The Incremental Development of Correct Specifications for Distributed Systems
 Proc. FME '96, LNCS (SpringerVerlag
, 1996
"... . Provably correct software can only be achieved by basing the development process on formal methods. For most industrial applications such a development never terminates because requirements change and new functionality has to be added to the system. Therefore a formal method that supports an incre ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
more formal approach to the development of correct telecommunications software. These ProCoSmethods have been adapted to support the development of extensible specifications for distributed systems. Throughout this paper our approach is exemplified by a case study how call handling software
Smooth Tests for Correct Specification of Conditional Predictive Densities
, 2015
"... We develop two specification tests of predictive densities based on that the generalized residuals of correctly specified predictive density models are i.i.d. uniform. The simultaneous test compares the joint density of generalized residuals with product of uniform densities; the sequential test ex ..."
Abstract
 Add to MetaCart
We develop two specification tests of predictive densities based on that the generalized residuals of correctly specified predictive density models are i.i.d. uniform. The simultaneous test compares the joint density of generalized residuals with product of uniform densities; the sequential test
Results 11  20
of
2,250,884