332 search results - page 20 / 67 » Complexity analysis of a decentralised graph colouring algor... |
PODC
2011
ACM
12 years 10 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
JNSM
2008
13 years 7 months ago
2008
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...