1615 search results - page 255 / 323 » Computer science and decision theory |
152
click to vote
ENTCS
2007
15 years 4 months ago
2007
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
144
click to vote
EATCS
2000
15 years 4 months ago
2000
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
130
click to vote
SIGCSE
2002
ACM
15 years 3 months ago
2002
ACM
In this paper, we examine implications of definitions of information technology to women's participation in the industry and in academe. This paper is exploratory only, based...
109
click to vote
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
131
click to vote
HICSS
2003
IEEE
15 years 9 months ago
2003
IEEE
We define and develop a solution approach for planning, scheduling and managing project efforts where there is significant uncertainty in the duration, resource requirements and o...