1736 search results - page 181 / 348 » The rank-width of Directed Graphs |
182
click to vote
SPAA
2006
ACM
16 years 15 days ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
190
click to vote
UAI
2008
15 years 8 months ago
2008
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
153
click to vote
JAR
2000
15 years 6 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
179
click to vote
RC
2000
15 years 6 months ago
2000
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
154
click to vote
IJFCS
1998
15 years 6 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...