11 search results - page 2 / 3 » Small Induced-Universal Graphs and Compact Implicit Graph Re... |
127
Voted
ICNP
2007
IEEE
15 years 10 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...
137
Voted
COMCOM
2006
15 years 3 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...
93
Voted
CIG
2005
IEEE
15 years 9 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...
146
Voted
GMP
2010
IEEE
15 years 8 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...
153
Voted
INFORMS
1998
15 years 3 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...