Sciweavers

3154 search results - page 127 / 631
» Computing Closed Skycubes
Sort
View
ISMIS
2005
Springer
14 years 3 months ago
Normal Forms for Knowledge Compilation
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...
Reiner Hähnle, Neil V. Murray, Erik Rosenthal
ANTS
2004
Springer
149views Algorithms» more  ANTS 2004»
14 years 3 months ago
A Binary Recursive Gcd Algorithm
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
Damien Stehlé, Paul Zimmermann
CONCUR
2004
Springer
14 years 3 months ago
Message-Passing Automata Are Expressively Equivalent to EMSO Logic
Abstract. We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are...
Benedikt Bollig, Martin Leucker
EURONGI
2004
Springer
14 years 3 months ago
A Family of Encounter-Based Broadcast Protocols for Mobile Ad-Hoc Networks
A family of message propagation protocols for highly mobile ad-hoc networks is defined, and is studied analytically and by simulation. The coverage of a message (the fraction of n...
Dave E. Cooper, Paul D. Ezhilchelvan, Isi Mitrani
EUROPAR
2004
Springer
14 years 3 months ago
Accelerating Apache Farms Through Ad-HOC Distributed Scalable Object Repository
We present hoc: a fast, scalable object repository providing programmers with a general storage module. hoc may be used to implement DSMs as well as distributed cache subsystems. h...
Marco Aldinucci, Massimo Torquati