2473 search results - page 72 / 495 » The Logic of Communication Graphs |
DALT
2008
Springer
13 years 9 months ago
2008
Springer
We propose a variant of alternating time temporal logic (ATL) with imperfect information, perfect recall, epistemic modalities for the past and strategies which are required to be ...
CLIMA
2004
13 years 9 months ago
2004
In this paper we propose a formal specification of a persuasion protocol between autonomous agents using an approach based on social commitments and arguments. In order to be flexi...
ADHOCNOW
2008
Springer
14 years 2 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
COLOGNETWENTE
2007
13 years 9 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
PPL
2000
13 years 7 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...