187 search results - page 22 / 38 » On the Natural Imprint Function of a Graph |
189
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
191
click to vote
CDC
2010
IEEE
15 years 27 days ago
2010
IEEE
Abstract-- Curves and natural frames can be used for describing and controlling motion in both biological and engineering contexts (e.g., pursuit and formation control). The geomet...
176
click to vote
PPOPP
2012
ACM
14 years 1 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
156
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
145
click to vote
SOFSEM
2007
Springer
15 years 12 months ago
2007
Springer
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...