780 search results - page 11 / 156 » Reasoning about sets using redescription mining |
LFP
1992
15 years 26 days ago
1992
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
103
click to vote
ICDCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We argue that joint administration of access policies for a dynamic coalition formed by autonomous domains requires that these domains set up a coalition authority that distribute...
ICMI
2003
Springer
15 years 4 months ago
2003
Springer
We present methods for inferring the cost of interrupting users based on multiple streams of events including information generated by interactions with computing devices, visual ...
149
click to vote
PSSE
2004
Springer
15 years 5 months ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
119
click to vote
IJCAI
1997
15 years 1 months ago
1997
As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a ...