1986 search results - page 369 / 398 » Path Separability of Graphs |
SAS
1999
Springer
13 years 11 months ago
1999
Springer
Programs represented in Static Single Assignment (SSA) form contain phi instructions (or functions) whose operational semantics are to merge values coming from distinct control flo...
CGO
2008
IEEE
13 years 9 months ago
2008
IEEE
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
AAAI
2010
13 years 9 months ago
2010
Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world ta...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
EJC
2007
13 years 7 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...