Sciweavers

8699 search results - page 1703 / 1740
» Elements of the Theory of Computation
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 2 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ESORICS
2007
Springer
15 years 2 months ago
Satisfiability and Resiliency in Workflow Systems
We propose the role-and-relation-based access control (R2 BAC) model for workflow systems. In R2 BAC, in addition to a user's role memberships, the user's relationships w...
Qihua Wang, Ninghui Li
EMSOFT
2009
Springer
15 years 2 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
AI50
2006
15 years 2 months ago
The iCub  Cognitive Humanoid Robot: An Open-System Research Platform for Enactive Cognition
Abstract. This paper describes a multi-disciplinary initiative to promote collaborative research in enactive artificial cognitive systems by developing the iCub : a open-systems 53...
Giulio Sandini, Giorgio Metta, David Vernon
ATAL
2006
Springer
15 years 2 months ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo
« Prev « First page 1703 / 1740 Last » Next »