1159 search results - page 103 / 232 » Binary Decision Graphs |
163
click to vote
FUIN
2006
15 years 6 months ago
2006
Abstract. We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of ...
154
click to vote
ENTCS
2007
15 years 6 months ago
2007
The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specificatio...
210
click to vote
LOGCOM
1998
15 years 6 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
164
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
154
click to vote
WG
1998
Springer
15 years 10 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....