Sciweavers

1615 search results - page 93 / 323
» Computer science and decision theory
Sort
View
FOSSACS
2005
Springer
15 years 6 months ago
Mathematical Models of Computational and Combinatorial Structures
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
Marcelo P. Fiore
DAGSTUHL
2008
15 years 2 months ago
The Grand Challenges and Myths of Neural-Symbolic Computation
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...
Luís C. Lamb
87
Voted
SIGCSE
2009
ACM
127views Education» more  SIGCSE 2009»
15 years 7 months ago
A history of computing course with a technical focus
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...
Geoffrey M. Draper, Robert R. Kessler, Richard F. ...
161
Voted
HICSS
2003
IEEE
164views Biometrics» more  HICSS 2003»
15 years 5 months ago
From Computer Networks to Agent Networks
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...
Guoqiang Zhong, Kenichi Takahashi, Satoshi Amamiya...
108
Voted
ICALP
2007
Springer
15 years 6 months ago
Model Theory Makes Formulas Large
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...
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole...