22 search results - page 3 / 5 » Do you know your terms |
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
ICRE
2000
IEEE
14 years 7 hour ago
2000
IEEE
Unless you have a complete and precise description of your product’s requirements, it is very unlikely that you will satisfy those requirements. A requirements document that is ...
SIGUCCS
2003
ACM
14 years 26 days ago
2003
ACM
Working on a small campus has many advantages: Familiarity with the majority of faculty and staff, in-depth knowledge of how systems interact, adding the personal touch to each in...
CCR
2006
13 years 7 months ago
2006
If despite your better judgment you decide to read this article, keep in mind that it was written during the summer, and this has been the hottest summer ever. To avoid such artic...
NIPS
2008
13 years 9 months ago
2008
Randomized neural networks are immortalized in this well-known AI Koan: In the days when Sussman was a novice, Minsky once came to him as he sat hacking at the PDP-6. "What a...