Sciweavers

4586 search results - page 107 / 918
» Computing stable models in parallel
Sort
View
155
Voted
CONCUR
2006
Springer
15 years 4 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
140
Voted
IPPS
1998
IEEE
15 years 6 months ago
A Molecular Quasi-Random Model of Computations Applied to Evaluate Collective Intelligence
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
Tadeusz Szuba
198
Voted
ATVA
2011
Springer
295views Hardware» more  ATVA 2011»
14 years 2 months ago
Parallel Nested Depth-First Searches for LTL Model Checking
Even though the well-known nested-depth first search algorithm for LTL model checking provides good performance, it cannot benefit from the recent advent of multi-core computers....
Sami Evangelista, Laure Petrucci, Samir Youcef
105
Voted
CONCURRENCY
2002
116views more  CONCURRENCY 2002»
15 years 2 months ago
Parallel implementation of the fluid particle model for simulating complex fluids in the mesoscale
Dissipative particle dynamics (DPD) and its generalization - fluid particle model (FPM) - represent the "fluid particle" approach for simulating fluid-like behavior in t...
Krzysztof Boryczko, Witold Dzwinel, David A. Yuen
99
Voted
SPDP
1991
IEEE
15 years 6 months ago
A decentralized task scheduling algorithm and its performance modeling for computer networks
A dynamic taskschedulingalgorithm,that isstable,decentralized,and adaptivetonetwork topology,ispresented. Theproposedalgorithmisanextensionofnearestneighbor loadbalancingstrategyw...
Ishfaq Ahmad, Arif Ghafoor, Kishan G. Mehrotra