Sciweavers

6020 search results - page 12 / 1204
» A New Approach to Model Counting
Sort
View
IWMM
2000
Springer
105views Hardware» more  IWMM 2000»
15 years 3 months ago
Diffusion Tree Restructuring for Indirect Reference Counting
A new variant algorithm for distributed acyclic garbage detection is presented for use in hybrid garbage collectors. The existing fault-tolerance of Piquer's Indirect Referen...
Peter Dickman
80
Voted
WDAG
2007
Springer
92views Algorithms» more  WDAG 2007»
15 years 5 months ago
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
Abstract. Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computation...
Joffroy Beauquier, Julien Clement, Stéphane...
104
Voted
TCS
2008
14 years 11 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
90
Voted
PLANX
2008
15 years 1 months ago
Linear Time Membership for a Class of XML Types with Interleaving and Counting
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
CP
2007
Springer
15 years 5 months ago
Solution Counting Algorithms for Constraint-Centered Search Heuristics
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
Alessandro Zanarini, Gilles Pesant