2473 search results - page 265 / 495 » The Logic of Communication Graphs |
174
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
178
click to vote
JCP
2006
15 years 6 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
166
click to vote
DAM
2002
15 years 6 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
216
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we address the problem of physical node capture attacks in wireless sensor networks and provide a control theoretic framework to model physical node capture, cloned n...
157
click to vote
AIPS
2008
15 years 9 months ago
2008
When controlling an autonomous system, it is inefficient or sometimes impossible for the human operator to specify detailed commands. Instead, the field of AI autonomy has develop...