13214 search results - page 25 / 2643 » Pseudorandomness for network algorithms |
149
click to vote
DAC
2006
ACM
16 years 6 months ago
2006
ACM
Traces Kuntal Nanshi, Fabio Somenzi University of Colorado at Boulder ne abstraction refinement and simulation to provide a more efficient approach to checking invariant properti...
123
click to vote
DCC
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper, we describe a solution to the register synthesis problem for a class of sequence generators known as Algebraic Feedback Shift Registers. These registers are based o...
155
click to vote
COCO
2007
Springer
16 years 3 days ago
2007
Springer
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
147
click to vote
SAT
2007
Springer
16 years 1 days ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
146
click to vote
ICCS
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we present error and performance analysis of a Monte Carlo variance reduction method for solving multidimensional integrals and integral equations. This method, calle...