1615 search results - page 97 / 323 » Computer science and decision theory |
167
click to vote
LICS
2008
IEEE
16 years 15 days ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
150
Voted
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
155
click to vote
CSCW
1998
ACM
15 years 10 months ago
1998
ACM
CSCW seems to have a persistent problem of understanding the nature of “cooperative work”. This paper argues that this problem is a direct result of not looking at the dynamic...
169
click to vote
RTA
2009
Springer
16 years 20 days ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
141
Voted
GG
2004
Springer
15 years 11 months ago
2004
Springer
There would seem to be a natural connection between graphs and information security. This is particularly so in the arena of access control and authorization. Research on applying ...