11 search results - page 2 / 3 » Small Induced-Universal Graphs and Compact Implicit Graph Re... |
ICNP
2007
IEEE
13 years 11 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
COMCOM
2006
13 years 5 months ago
2006
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
CIG
2005
IEEE
13 years 11 months ago
2005
IEEE
AbstractWe describe Utile Coordination, an algorithm that allows a multiagent system to learn where and how to coordinate. The method starts with uncoordinated learners and maintai...
GMP
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
INFORMS
1998
13 years 5 months ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...