Sciweavers

129 search results - page 21 / 26
» Lower Bounds for Testing Triangle-freeness in Boolean Functi...
Sort
View
GLVLSI
1999
IEEE
92views VLSI» more  GLVLSI 1999»
13 years 12 months ago
Fault Coverage Estimation for Early Stage of VLSI Design
This paper proposes a new fault coverage estimation model which can be used in the early stage of VLSI design. The fault coverage model is an exponentially decaying function with ...
Von-Kyoung Kim, Tom Chen, Mick Tegethoff
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
13 years 7 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
ICALP
2009
Springer
14 years 8 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
JC
2007
109views more  JC 2007»
13 years 7 months ago
Cubature formulas for function spaces with moderate smoothness
We construct simple algorithms for high-dimensional numerical integration of function classes with moderate smoothness. These classes consist of square-integrable functions over t...
Michael Gnewuch, René Lindloh, Reinhold Sch...
WSC
2004
13 years 9 months ago
Function-Approximation-Based Importance Sampling for Pricing American Options
Monte Carlo simulation techniques that use function approximations have been successfully applied to approximately price multi-dimensional American options. However, for many pric...
Nomesh Bolia, Sandeep Juneja, Paul Glasserman