-- Our cyber defenses are static and are governed by lengthy processes, e.g., for testing and security patch deployment. Adversaries could plan their attacks carefully over time and launch attacks at cyber speeds at any given moment. We need a new class of defensive strategies t…
Our cyber defenses are static and are governed by lengthy processes, e.g., for testing and security patch deployment. Adversaries could plan their attacks carefully over time and launch attacks at cyber speeds at any given moment. We need a new class of defensive strategies that…
Knowledge and data management in GRIDs
by Talia, Domenico, Bilas, Angelos, Dikaiakos, Marios D.
fromCoreGrid
Theoretical and mathematical foundations of computer science: second International Conference, ICTMF 2011, Sing…
by Zhou, Qihai, International Conference on Theoretical and Mathematical Foundations of Computer Science, ICTMF, Singapore), International Conference on High Performance Networking, Computing, and Communication Systems, Singapore)
fromCommunications in computer and information science
Annotation Constituting the refereed proceedings of the 12th Algorithms and Data Structures Symposium held in New York in August 2011, this text presents original research on the theory and application of algorithms and data structures in all areas, including combinatorics, comp…
Approximation, randomization, and combinatorial optimization: algorithms and techniques : 14th international wo…
by Goldberg, Leslie Ann, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Princeton, N.J.), International Workshop on Randomization and Computation, RANDOM, Princeton, N.J.)
fromLecture Notes in Computer Science
This book constitutes the refereed proceedings of the Third International Symposium on Engineering Secure Software and Systems, ESSoS 2011, held in Madrid, Italy, in February 2011. The 18 revised full papers presented together with 3 idea papers were carefully reviewed and selec…