Sciweavers

1795 search results - page 228 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
SAC
2008
ACM
15 years 9 days ago
Towards self-configuration and management of e-service provisioning in dynamic value constellations
Networked value constellations are collections of enterprises that jointly satify complex consumer needs. Increasingly, such needs are satisfied by e-services, i.e. commercial ser...
Jaap Gordijn, Hans Weigand, Manfred Reichert, Roel...
114
Voted
AMW
2009
14 years 10 months ago
Schema Design for Uncertain Databases
We address schema design in uncertain databases. Since uncertain data is relational in nature, decomposition becomes a key issue in design. Decomposition relies on dependency theo...
Anish Das Sarma, Jeffrey D. Ullman, Jennifer Widom
ICIP
2004
IEEE
16 years 2 months ago
Low-complexity rate-distortion optimized video streaming
This paper proposes two techniques for low-complexity rate-distortion (R-D) optimized streaming of packetized video. These techniques enable computing packet transmission schedule...
Jacob Chakareski, John G. Apostolopoulos, Bernd Gi...
92
Voted
DAC
2007
ACM
16 years 1 months ago
Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs
A key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks...
Maarten Wiggers, Marco Bekooij, Gerard J. M. Smit
101
Voted
CAV
2009
Springer
157views Hardware» more  CAV 2009»
16 years 1 months ago
Explaining Counterexamples Using Causality
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
Ilan Beer, Shoham Ben-David, Hana Chockler, Avigai...