Sciweavers

1336 search results - page 263 / 268
» Modelling and Analysis of PKI-Based Systems Using Process Ca...
Sort
View
KES
1999
Springer
13 years 11 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli
SIGMETRICS
2010
ACM
195views Hardware» more  SIGMETRICS 2010»
13 years 11 months ago
CWS: a model-driven scheduling policy for correlated workloads
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
EJIS
2010
52views more  EJIS 2010»
13 years 7 months ago
Same technology, different outcome? Reinterpreting Barley's Technology as an Occasion for Structuring
In the last few decades, several studies have found the same technology implemented in highly similar organizational settings to be associated with very different consequences for...
Starling David Hunter III
MBEES
2008
13 years 8 months ago
Composition of Model-based Test Coverage Criteria
: In this paper, we discuss adjustable coverage criteria and their combinations in model-based testing. We formalize coverage criteria and specify test goals using OCL. Then, we pr...
Mario Friske, Bernd-Holger Schlingloff, Stephan We...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...