Sciweavers

2110 search results - page 143 / 422
» What is the complexity of a distributed computing system
Sort
View
GECCO
2005
Springer
220views Optimization» more  GECCO 2005»
15 years 10 months ago
Scale invariant pareto optimality: a meta--formalism for characterizing and modeling cooperativity in evolutionary systems
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
Mark Fleischer
PODC
2005
ACM
15 years 10 months ago
Stochastic analysis of distributed deadlock scheduling
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
Shigang Chen, Yibei Ling
FLAIRS
2004
15 years 6 months ago
Physical Approximations for Urban Fire Spread Simulations
The issue of fire propagation in cities is of obvious importance to Civil Authorities, but does present issues of computational complexity. Our basic assumption is that some event...
Daniel J. Bertinshaw, Hans W. Guesgen
IPPS
2006
IEEE
15 years 10 months ago
Modeling and executing master-worker applications in component models
— This paper describes work in progress to extend component models to support Master-Worker applications and to let them to be executed on Grid infrastructures. The proposed appr...
Hinde-Lilia Bouziane, Christian Pérez, Thie...
IPPS
2006
IEEE
15 years 10 months ago
Network intrusion detection with semantics-aware capability
Malicious network traffic, including widespread worm activity, is a growing threat to Internet-connected networks and hosts. In this paper, we propose a network intrusion detectio...
Walter J. Scheirer, Mooi Choo Chuah