Sciweavers

1414 search results - page 175 / 283
» Combining Intruder Theories
Sort
View
DCC
2005
IEEE
16 years 5 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
MOBIHOC
2003
ACM
16 years 5 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
ICCAD
2002
IEEE
104views Hardware» more  ICCAD 2002»
16 years 2 months ago
A new enhanced SPFD rewiring algorithm
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
Jason Cong, Joey Y. Lin, Wangning Long
PADL
2010
Springer
16 years 2 months ago
Implementing Query Answering for Hybrid MKNF Knowledge Bases
Abstract. Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rule...
Ana Sofia Gomes, José Júlio Alferes,...
TACAS
2010
Springer
191views Algorithms» more  TACAS 2010»
16 years 1 months ago
Blocked Clause Elimination
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
Matti Järvisalo, Armin Biere, Marijn Heule