Sciweavers

64 search results - page 3 / 13
» Reducing the Size of NFAs by Using Equivalences and Preorder...
Sort
View
VMCAI
2009
Springer
14 years 1 days ago
LTL Generalized Model Checking Revisited
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
Patrice Godefroid, Nir Piterman
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
13 years 11 months ago
Equivalence verification of arithmetic datapaths with multiple word-length operands
Abstract: This paper addresses the problem of equivalence veriļ¬cation of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have diļ¬...
Namrata Shekhar, Priyank Kalla, Florian Enescu
TCAD
2008
96views more  TCAD 2008»
13 years 5 months ago
An Implicit Approach to Minimizing Range-Equivalent Circuits
Abstract--Simplifying a combinational circuit while preserving its range has a variety of applications, such as combinational equivalence checking and random simulation. Previous a...
Yung-Chih Chen, Chun-Yao Wang
ESSMAC
2003
Springer
13 years 10 months ago
Analysis of Some Methods for Reduced Rank Gaussian Process Regression
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classiļ¬cation problems, their computational com...
Joaquin Quiñonero Candela, Carl Edward Rasm...
SIGCOMM
2004
ACM
13 years 10 months ago
Sizing router buffers
All Internet routers contain buļ¬€ers to hold packets during times of congestion. Today, the size of the buļ¬€ers is determined by the dynamics of TCPā€™s congestion control algor...
Guido Appenzeller, Isaac Keslassy, Nick McKeown