1410 search results - page 90 / 282 » The Algorithmics of Solitaire-Like Games |
102
click to vote
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
SIGECOM
2010
ACM
14 years 11 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
87
Voted
SIGCSE
2009
ACM
15 years 12 months ago
2009
ACM
In this paper, we introduce the concept of breadth-last technical elective courses, which are designed to assist undergraduate CS students in integrating their entire core curricu...
121
click to vote
GLOBECOM
2008
IEEE
15 years 5 months ago
2008
IEEE
—Cooperative spectrum sensing has been shown to greatly improve the sensing performance in cognitive radio networks. However, if the cognitive users belong to different service p...
115
click to vote
PIMRC
2008
IEEE
15 years 5 months ago
2008
IEEE
ACT We consider a cognitive radio scenario in which two (or more) operators providing services in the same area wish to share the same licensed band of spectrum. This scenario diff...