Sciweavers

1923 search results - page 43 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 5 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
SPIN
2001
Springer
14 years 3 months ago
Distributed LTL Model-Checking in SPIN
Abstract. In this paper we propose a distributed algorithm for modelchecking LTL. In particular, we explore the possibility of performing nested depth-first search algorithm in di...
Jiri Barnat, Lubos Brim, Jitka Stríbrn&aacu...
JSSPP
2005
Springer
14 years 4 months ago
ScoPred-Scalable User-Directed Performance Prediction Using Complexity Modeling and Historical Data
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
Benjamin J. Lafreniere, Angela C. Sodan
FC
2007
Springer
122views Cryptology» more  FC 2007»
14 years 5 months ago
Mental Models of Security Risks
1 2 There is a critical need in computer security to communicate risks and thereby enable informed decisions by naive users. Yet computer security has not been engaged with the sc...
Farzaneh Asgharpour, Debin Liu, L. Jean Camp
EDOC
2002
IEEE
14 years 3 months ago
Model-Based Risk Assessment to Improve Enterprise Security
The main objective of the CORAS project is to provide methods and tools for precise, unambiguous, and efficient risk assessment of security critical systems. To this end, we advoc...
Jan Øyvind Aagedal, Folker den Braber, Theo...