14084 search results - page 229 / 2817 » A Theory for Game Theories |
165
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
169
click to vote
IJCAI
2007
15 years 8 months ago
2007
In this paper, we propose a new progression mechanism for a restricted form of incomplete knowledge formulated as a basic action theory in the situation calculus. Specifically, w...
134
click to vote
ACE
2004
15 years 8 months ago
2004
In computer science education, the topic of computing theory is one that is commonly not well received by students. Career-oriented students often view the topic as irrelevant, an...
181
click to vote
FLAIRS
2006
15 years 8 months ago
2006
The inherent vagueness and ambiguity of non-monotonic reasoning makes it impossible to formulate detailed specifications to validate KBS performance by using traditional test-case...
176
click to vote
ACE
2003
15 years 8 months ago
2003
Web engineering constitutes the employment of an engineering approach to the development of Web applications. Its main teaching objectives are for students to learn what an engine...