4586 search results - page 216 / 918 » Computing stable models in parallel |
149
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
146
click to vote
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
134
click to vote
ACCV
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we take a predefined geometry shape as a constraint for accurate shape alignment. A shape model is divided in two parts: fixed shape and active shape. The fixed shap...
134
click to vote
PADS
2004
ACM
15 years 9 months ago
2004
ACM
With Parallel and Discrete Event Simulation (PDES) techniques, the runtime performance of detailed wireless network simulation can be improved significantly without compromising ...
109
click to vote
CCGRID
2002
IEEE
15 years 9 months ago
2002
IEEE
Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of ...