Sciweavers

1805 search results - page 168 / 361
» A Theory of Closure Operators
Sort
View
212
Voted
EMSOFT
2007
Springer
16 years 1 months ago
The algebra of connectors: structuring interaction in BIP
We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types a...
Simon Bliudze, Joseph Sifakis
218
Voted
SWS
2004
ACM
16 years 13 days ago
Creating non-decomposable stream bundles in multimedia web services using uSMIL
Technical advances in networks, operating systems and web based services are enabling new web-based services such as audiovisual surveillance, monitoring and recording of unfoldin...
Naren Kodali, Csilla Farkas, Duminda Wijesekera
197
Voted
WDAG
2004
Springer
88views Algorithms» more  WDAG 2004»
16 years 11 days ago
Nonblocking Concurrent Data Structures with Condition Synchronization
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
William N. Scherer III, Michael L. Scott
CHI
1999
ACM
15 years 11 months ago
Direct Combination
This paper reports on Direct Combination, a new user interaction technique. Direct Combination may be viewed variously as: a systematic extension to Direct Manipulation; a concise...
Simon Holland, Daniel Oppenheim
172
Voted
SIGCOMM
1994
ACM
15 years 11 months ago
Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and sel sh, and (2) central admini...
Scott Shenker