Sciweavers

19367 search results - page 3689 / 3874
» Fine-Grain Process Modelling
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 8 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
143
Voted
PADS
1999
ACM
15 years 8 months ago
Shock Resistant Time Warp
In an attempt to cope with time-varying workload, traditional adaptive Time Warp protocols are designed to react in response to performance changes by altering control parameter c...
Alois Ferscha, James Johnson
SRDS
1999
IEEE
15 years 8 months ago
Formal Hazard Analysis of Hybrid Systems in cTLA
Hybrid systems like computer-controlled chemical plants are typical safety critical distributed systems. In present practice, the safety of hybrid systems is guaranteed by hazard ...
Peter Herrmann, Heiko Krumm
ISN
1999
Springer
159views Communications» more  ISN 1999»
15 years 8 months ago
Accounting Management in a TINA-Based Service and Network Environment
The ACTS FlowThru project aims to build a management system which supports the flow of management information across organisational and technological domains by reusing components ...
Patrick Hellemans, Cliff Redmond, Koen Daenen, Dav...
KES
1999
Springer
15 years 8 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
« Prev « First page 3689 / 3874 Last » Next »