Sciweavers

1923 search results - page 231 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
CCS
2009
ACM
15 years 4 months ago
Keep your friends close: the necessity for updating an anomaly sensor with legitimate environment changes
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
Angelos Stavrou, Gabriela F. Cretu-Ciocarlie, Mich...
SGP
2003
14 years 11 months ago
Statistical Point Geometry
We propose a scheme for modeling point sample geometry with statistical analysis. In our scheme we depart from the current schemes that deterministically represent the attributes ...
Aravind Kalaiah, Amitabh Varshney
ACSAC
2004
IEEE
15 years 1 months ago
Using Predators to Combat Worms and Viruses: A Simulation-Based Study
Large-scale attacks generated by fast-spreading or stealthy malicious mobile code, such as flash worms and e-mail viruses, demand new approaches to patch management and disinfecti...
Ajay K. Gupta 0002, Daniel C. DuVarney
ICDCS
2003
IEEE
15 years 3 months ago
Cross-Feature Analysis for Detecting Ad-Hoc Routing Anomalies
With the proliferation of wireless devices, mobile ad hoc networking (MANET) has become a very exciting and important technology due to its characteristics of open medium and dyna...
Yi-an Huang, Wei Fan, Wenke Lee, Philip S. Yu
AGENTS
2001
Springer
15 years 2 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis