Sciweavers

163 search results - page 19 / 33
» Composition Theorems in Communication Complexity
Sort
View
ICCCN
2007
IEEE
15 years 4 months ago
Large-Scale QoS-Aware Service-Oriented Networking with a Clustering-Based Approach
—Motivated by the fact that most of the existing QoS service composition solutions have limited scalability, we develop a hierarchical-based solution framework to achieve scalabi...
Jingwen Jin, Jin Liang, Jingyi Jin, Klara Nahrsted...
PODS
2008
ACM
165views Database» more  PODS 2008»
15 years 9 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
CDC
2009
IEEE
144views Control Systems» more  CDC 2009»
15 years 1 months ago
Stochastic control over finite capacity channels: Causality, feedback and uncertainty
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...
Charalambos D. Charalambous, Christos K. Kourtella...
CORR
2002
Springer
166views Education» more  CORR 2002»
14 years 9 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
DAC
2000
ACM
15 years 10 months ago
Synthesis and optimization of coordination controllers for distributed embedded systems
A main advantage of control composition with modal processes [4] is the enhanced retargetability of the composed behavior over a wide variety of target architectures. Unlike previ...
Pai H. Chou, Gaetano Borriello