966 search results - page 180 / 194 » Communicating Answer Set Programs |
104
click to vote
IFIP
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
109
Voted
SASO
2008
IEEE
15 years 8 months ago
2008
IEEE
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
112
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
115
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
118
click to vote
KDD
2005
ACM
16 years 2 months ago
2005
ACM
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...