330 search results - page 38 / 66 » Algorithms for Propositional Model Counting |
111
click to vote
ICTCS
2005
Springer
15 years 7 months ago
2005
Springer
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...
113
click to vote
HICSS
1997
IEEE
15 years 5 months ago
1997
IEEE
This paper presents scalable algorithms for recovery and page coherency in multicomputer object stores. Recovery and coherency are central to object store engineering and distribu...
135
click to vote
VISSYM
2003
15 years 3 months ago
2003
Volumetric samples on Cartesian lattices are less efficient than samples on body-centred cubic (BCC) lattices. We show how to construct isosurfaces on BCC lattices using several ...
PVM
2009
Springer
15 years 8 months ago
2009
Springer
Petascale machines with close to a million processors will soon be available. Although MPI is the dominant programming model today, some researchers and users wonder (and perhaps e...
118
click to vote
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
Markov logic networks (MLNs) are a statistical relational model that consists of weighted firstorder clauses and generalizes first-order logic and Markov networks. The current sta...