3575 search results - page 188 / 715 » Presentations of computably enumerable reals |
157
click to vote
DATE
2006
IEEE
16 years 15 days ago
2006
IEEE
Most hardware description languages do not enforce determinacy, meaning that they may yield races. Race conditions pose a problem for the implementation, verification, and validat...
177
click to vote
SPIN
2004
Springer
15 years 11 months ago
2004
Springer
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
135
click to vote
ARITH
1993
IEEE
15 years 10 months ago
1993
IEEE
We detail and analyse the critical techniques which may be combined in the design of fast hardware for RSA cryptography: chinese remainders, star chains, Hensel's odd divisio...
178
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
184
click to vote
EOR
2010
15 years 6 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...