1653 search results - page 158 / 331 » Computer science and game theory |
DAGSTUHL
2008
14 years 11 months ago
2008
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
71
Voted
SIGCSE
2009
ACM
15 years 5 months ago
2009
ACM
Many courses on the history of computing are designed for a general student audience, and as such, include fewer technical details than one might find in a typical CS course. Whi...
138
click to vote
HICSS
2003
IEEE
15 years 3 months ago
2003
IEEE
From the 1990s on, one of the most important challenges facing computer science researchers has been the design and construction of software tools to exploit Internet computing. A...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...