2322 search results - page 334 / 465 » On a game in directed graphs |
264
click to vote
CC
2009
Springer
16 years 7 months ago
2009
Springer
Register allocation decides which parts of a variable's live range are held in registers and which in memory. The compiler inserts spill code to move the values of variables b...
152
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
141
click to vote
ICSE
2007
IEEE-ACM
16 years 6 months ago
2007
IEEE-ACM
We introduce SoftGUESS, a code clone exploration system. SoftGUESS is built on the more general GUESS system which provides users with a mechanism to interactively explore graph s...
179
click to vote
PERCOM
2004
ACM
16 years 6 months ago
2004
ACM
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
165
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure. We make extensive use of s...