Sciweavers

1581 search results - page 298 / 317
» Domain semantics of possibility computations
Sort
View
SIGCSE
1990
ACM
126views Education» more  SIGCSE 1990»
14 years 1 months ago
A philosophy and example of CS-1 programming projects
This paper presents a philosophy underlying CS-1 programming projects, and illustrates this philosophy with a concrete example. Integral to the philosophy is the use of Ada packag...
Richard E. Pattis
CONCUR
2010
Springer
13 years 11 months ago
Obliging Games
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
Krishnendu Chatterjee, Florian Horn, Christof L&ou...
JANCL
2008
109views more  JANCL 2008»
13 years 9 months ago
Conditionalization and total knowledge
This paper employs epistemic logic to investigate the philosophical foundations of Bayesian updating in belief revision. By Bayesian updating, we understand the tenet that an agen...
Ian Pratt-Hartmann
GROUP
2010
ACM
13 years 7 months ago
Design, implementation, and evaluation of an approach for determining when programmers are having difficulty
Previous research has motivated the idea of automatically determining when programmers are having difficulty, provided an initial algorithm (unimplemented in an actual system), an...
Jason Carter, Prasun Dewan
CVPR
2012
IEEE
12 years 8 days ago
Automatic discovery of groups of objects for scene understanding
Objects in scenes interact with each other in complex ways. A key observation is that these interactions manifest themselves as predictable visual patterns in the image. Discoveri...
Congcong Li, Devi Parikh, Tsuhan Chen