Sciweavers

1618 search results - page 255 / 324
» Testing random number generators
Sort
View
ISCAS
2006
IEEE
106views Hardware» more  ISCAS 2006»
15 years 3 months ago
Integrating observability don't cares in all-solution SAT solvers
— All-solution Boolean satisfiability (SAT) solvers are engines employed to find all the possible solutions to a SAT problem. Their applications are found throughout the EDA in...
Sean Safarpour, Andreas G. Veneris, Rolf Drechsler
DSN
2006
IEEE
15 years 1 months ago
Using Attack Injection to Discover New Vulnerabilities
Due to our increasing reliance on computer systems, security incidents and their causes are important problems that need to be addressed. To contribute to this objective, the pape...
Nuno Ferreira Neves, João Antunes, Miguel C...
OWLED
2008
14 years 11 months ago
HermiT: A Highly-Efficient OWL Reasoner
Abstract. HermiT is a new OWL reasoner based on a novel "hypertableau" calculus. The new calculus addresses performance problems due to nondeterminism and model size--the...
Rob Shearer, Boris Motik, Ian Horrocks
INTERSPEECH
2010
14 years 4 months ago
Modeling liaison in French by using decision trees
French is known to be a language with major pronunciation irregularities at word endings with consonants. Particularly, the well-known phonetic phenomenon called Liaison is one of...
Josafá de Jesus Aguiar Pontes, Sadaoki Furu...
INFOCOM
2009
IEEE
15 years 4 months ago
Topology Formation for Wireless Mesh Network Planning
—Wireless mesh networks are becoming prevalent in providing access infrastructure to the public. Design of such networks involve several important goals including resilience to f...
Chun-cheng Chen, Chandra Chekuri, D. Klabjan