3353 search results - page 190 / 671 » Laver and set theory |
139
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
182
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
153
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We recently introduced an extensional model of the pure λcalculus living in a cartesian closed category of sets and relations. In this paper, we provide sufficient condi...
160
click to vote
CEC
2008
IEEE
16 years 29 days ago
2008
IEEE
Abstract— In this paper we present a novel intrusion detection architecture based on Idiotypic Network Theory (INIDIS), that aims at dealing with large scale network attacks feat...
203
click to vote
IPPS
2008
IEEE
16 years 27 days ago
2008
IEEE
—In this paper we present a novel intrusion detection architecture based on Idiotypic Network Theory (INIDS), that aims at dealing with large scale network attacks featuring vari...