Sciweavers

4218 search results - page 692 / 844
» Complete sets of cooperations
Sort
View
PPDP
2010
Springer
13 years 7 months ago
Equational axiomatization of call-by-name delimited control
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
Yukiyoshi Kameyama, Asami Tanaka
RTAS
2010
IEEE
13 years 7 months ago
Scheduling Dependent Periodic Tasks without Synchronization Mechanisms
—This article studies the scheduling of critical embedded systems, which consist of a set of communicating periodic tasks with constrained deadlines. Currently, tasks are usually...
Julien Forget, Frédéric Boniol, Emma...
SIROCCO
2010
13 years 7 months ago
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the abil...
Anissa Lamani, Maria Gradinariu Potop-Butucaru, S&...
SOCO
2010
Springer
13 years 7 months ago
Visualizing and Assessing a Compositional Approach of Business Process Design
Abstract. In the context of Services Oriented Architecture (Soa), complex systems are realized through the design of business–driven processes. Since the design of a complete pro...
Sébastien Mosser, Alexandre Bergel, Mireill...
XSYM
2010
Springer
148views Database» more  XSYM 2010»
13 years 7 months ago
Promoting the Semantic Capability of XML Keys
Keys for XML data trees can uniquely identify nodes based on the data values on some of their subnodes, either in the entire tree or relatively to some selected subtrees. Such keys...
Flavio Ferrarotti, Sven Hartmann, Sebastian Link, ...