398 search results - page 14 / 80 » Spider Diagrams of Order |
CHARME
2005
Springer
15 years 3 months ago
2005
Springer
Timing diagrams are useful for capturing temporal specifications in which all mentioned events are required to occur. We first show that translating timing diagrams with both par...
AAAI
2008
14 years 12 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
68
Voted
GD
2005
Springer
15 years 3 months ago
2005
Springer
Force-directed placement is a widely used approach to automatically arranging the nodes and edges of a relational diagram or graph in an aesthetically pleasing manner. The adoption...
JCT
2010
14 years 8 months ago
2010
We present a partial generalization to Schubert calculus on flag varieties of the classical Littlewood-Richardson rule, in its version based on Sch¨utzenberger’s jeu de taquin....