Results 1  10
of
470,448
Alphapower Law MOSFET Model and its Applications to CMOS Inverter Delay and other Formulas
 IEEE J. of SolidState Circs
, 1990
"... Abstract — A simple yet realistic MOS model, namely the apower law MOS model, is introduced to include the carrier velocity saturation effect, which becomes eminent in shortchannel MOSFET’S. The model is an extension of Shockley’s squarelaw MOS model in the saturation region. Since the model is s ..."
Abstract

Cited by 377 (10 self)
 Add to MetaCart
includes input waveform slope effects and parasitic drain/source resistance effects and can be used in simulation and/or optimization CAD tools. It is concluded that the CMOS inverter delay becomes less sensitive to the input waveform slope and shortcircuit dksipation increases as the earner velocity
Mutual information and minimum meansquare error in Gaussian channels
 IEEE TRANS. INFORM. THEORY
, 2005
"... This paper deals with arbitrarily distributed finitepower input signals observed through an additive Gaussian noise channel. It shows a new formula that connects the inputoutput mutual information and the minimum meansquare error (MMSE) achievable by optimal estimation of the input given the out ..."
Abstract

Cited by 288 (34 self)
 Add to MetaCart
This paper deals with arbitrarily distributed finitepower input signals observed through an additive Gaussian noise channel. It shows a new formula that connects the inputoutput mutual information and the minimum meansquare error (MMSE) achievable by optimal estimation of the input given
Hard and Easy Distributions of SAT Problems
, 1992
"... We report results from largescale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to ..."
Abstract

Cited by 255 (20 self)
 Add to MetaCart
We report results from largescale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible
Formula
"... July3,1995 Both the quality of the results of TEX's formula layout algorithm and the complexity of its description in the TEXbook [1] are hard to beat. The algorithm is (verbally) described as an imperative program with very complex control ow and complicated manipulations of the data structure ..."
Abstract
 Add to MetaCart
July3,1995 Both the quality of the results of TEX's formula layout algorithm and the complexity of its description in the TEXbook [1] are hard to beat. The algorithm is (verbally) described as an imperative program with very complex control ow and complicated manipulations of the data
On the Combinatorial and Algebraic Complexity of Quantifier Elimination
, 1996
"... In this paper, a new algorithm for performing quantifier elimination from first order formulas over real closed fields is given. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this date. A new feature of this algorithm is that the role of th ..."
Abstract

Cited by 230 (29 self)
 Add to MetaCart
of the algebraic part (the dependence on the degrees of the input polynomials) and the combinatorial part (the dependence on the number of polynomials) are separated. Another new feature is that the degrees of the polynomials in the equivalent quantifierfree formula that is output, are independent of the number
Inputs
"... Abstract — We consider the fundamental delay bounds for scheduling packets in an N ×N packet switch operating under the crossbar constraint. Algorithms that make scheduling decisions without considering queue backlog are shown to incur an average delay of at least O(N). We then prove that O(log(N)) ..."
Abstract
 Add to MetaCart
(log(N)) delay is achievable with a simple frame based algorithm that uses queue backlog information. This is the best known delay bound for packet switches, and is the first analytical proof that sublinear delay is achievable in a packet switch with random inputs. Index Terms — stochastic queueing analysis
• Input:
"... Censi • Based on the analysis of the error function. • Advantages over previous approaches: – It does not assume independent point correspondences. – Measurements can be correlated. – Both accurate and fast (closed form). ..."
Abstract
 Add to MetaCart
Censi • Based on the analysis of the error function. • Advantages over previous approaches: – It does not assume independent point correspondences. – Measurements can be correlated. – Both accurate and fast (closed form).
Input
"... In this paper, we describe an architectural modification to Soar that gives a Soar agent the opportunity to learn statistical information about the past success of its actions and utilize this information when selecting an operator. This mechanism serves the same purpose as production utilities in A ..."
Abstract
 Add to MetaCart
In this paper, we describe an architectural modification to Soar that gives a Soar agent the opportunity to learn statistical information about the past success of its actions and utilize this information when selecting an operator. This mechanism serves the same purpose as production utilities in ACTR, but the implementation is more directly tied to the standard definition of the reinforcement learning (RL) problem. The paper explains our implementation, gives a rationale for adding an RL capability to Soar, and shows results for SoarRL agents ’ performance on two tasks.
Results 1  10
of
470,448