Sciweavers

769 search results - page 73 / 154
» Simple Composition of Nets
Sort
View
COCO
1992
Springer
82views Algorithms» more  COCO 1992»
13 years 11 months ago
Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...
Stephen A. Bloch
MFCS
1994
Springer
13 years 11 months ago
A Proof System for Asynchronously Communicating Deterministic Processes
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
Frank S. de Boer, M. van Hulst
CIA
2006
Springer
13 years 11 months ago
Selecting Web Services Statistically
Abstract. Service oriented computing oers a new approach to programming. To be useful for large and diverse sets of problems, eective service selection and composition is crucial. ...
David Lambert, David Robertson
STOC
1987
ACM
82views Algorithms» more  STOC 1987»
13 years 11 months ago
Permutation Groups in NC
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
László Babai, Eugene M. Luks, &Aacut...
USENIX
2004
13 years 9 months ago
High Performance X Servers in the Kdrive Architecture
The common usage patterns of 2D drivers for the X Window System have changed over time. New extensions such as Render and Composite are creating new demands for 2D rendering which...
Eric Anholt