2436 search results - page 205 / 488 » Comonadic Notions of Computation |
143
click to vote
AIPS
2006
15 years 6 months ago
2006
Recently the problem of automatic composition of workflows has been receiving increasing interest. Initial investigation has shown that designing a practical and scalable composit...
140
click to vote
EJC
2003
15 years 6 months ago
2003
We describe here our ongoing research on modeling conceptual and narrative structure of fairytales by a computer system. In this paper we focus on the variations of fairytales base...
150
click to vote
IJCAI
1993
15 years 6 months ago
1993
Anytime algorithms, whose quality of results improves gradually as computation time increases, provide useful performance components for timecritical planning and control of robot...
147
click to vote
EUROPAR
2010
Springer
15 years 5 months ago
2010
Springer
This paper introduces a set object, namely a shared object that allows processes to add and remove values as well as take a snapshot of its content. A new consistency condition su...
121
click to vote
GG
2008
Springer
15 years 5 months ago
2008
Springer
We introduce ranked open nets, a reactive extension of Petri nets which generalises a basic open net model introduced in a previous work by allowing for a refined notion of interf...