1756 search results - page 229 / 352 » Directed scale-free graphs |
183
Voted
CC
2009
Springer
16 years 1 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...
83
Voted
STOC
2004
ACM
16 years 1 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...
75
Voted
ICSE
2007
IEEE-ACM
16 years 25 days 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...
109
click to vote
PERCOM
2004
ACM
16 years 10 days 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...
122
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...