Sciweavers

359 search results - page 12 / 72
» Multi-state Directed Acyclic Graphs
Sort
View
CPM
2004
Springer
87views Combinatorics» more  CPM 2004»
15 years 4 months ago
A Trie-Based Approach for Compacting Automata
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
Maxime Crochemore, Chiara Epifanio, Roberto Grossi...
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
15 years 3 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
105
Voted
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
15 years 3 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
JMLR
2010
143views more  JMLR 2010»
14 years 6 months ago
Beware of the DAG!
Directed acyclic graph (DAG) models are popular tools for describing causal relationships and for guiding attempts to learn them from data. In particular, they appear to supply a ...
A. Philip Dawid
AAIM
2009
Springer
105views Algorithms» more  AAIM 2009»
15 years 6 months ago
On Acyclicity of Games with Cycles
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm...