Sciweavers

803 search results - page 67 / 161
» Independence in Direct-Product Graphs
Sort
View
101
Voted
ICCAD
1994
IEEE
99views Hardware» more  ICCAD 1994»
15 years 4 months ago
Condition graphs for high-quality behavioral synthesis
Identifying mutual exclusiveness between operators during behavioral synthesis is important in order to reduce the required number of control steps or hardware resources. To impro...
Hsiao-Ping Juan, Viraphol Chaiyakul, Daniel D. Gaj...
UAI
2004
15 years 2 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown
COMBINATORICA
2008
112views more  COMBINATORICA 2008»
15 years 25 days ago
On the rigidity of molecular graphs
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
Bill Jackson, Tibor Jordán
82
Voted
TACAS
2007
Springer
74views Algorithms» more  TACAS 2007»
15 years 6 months ago
Shape Analysis by Graph Decomposition
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
Roman Manevich, Josh Berdine, Byron Cook, G. Ramal...
106
Voted
IJAR
2006
89views more  IJAR 2006»
15 years 22 days ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander