1653 search results - page 218 / 331 » Computer science and game theory |
108
click to vote
COCO
1994
Springer
15 years 3 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
ITICSE
2005
ACM
15 years 4 months ago
2005
ACM
Traditional teaching methods have acknowledged limitations. Lectures may be used to transmit information efficiently, but often fail to motivate students to engage with the subjec...
SYNTHESE
2011
14 years 6 months ago
2011
Computer simulations are an exciting tool that plays important roles in many scientific disciplines. This has attracted the attention of a number of philosophers of science. The m...
LATA
2009
Springer
15 years 5 months ago
2009
Springer
d abstract) Benjamin Carle, Paliath Narendran and Colin Scheriff Dept. of Computer Science University at Albany–SUNY Albany, NY 12222 June 19, 2007 In this paper we extend the ...
LICS
2009
IEEE
15 years 5 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...