Sciweavers

6142 search results - page 637 / 1229
» The Complexity of Partition Functions
Sort
View
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
15 years 9 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
DAGSTUHL
2008
15 years 8 months ago
A Modified Staggered Correction Arithmetic with Enhanced Accuracy and Very Wide Exponent Range
Abstract. A so called staggered precision arithmetic is a special kind of a multiple precision arithmetic based on the underlying floating point data format (typically IEEE double ...
Frithjof Blomquist, Werner Hofschuster, Walter Kr&...
GIL
2008
15 years 8 months ago
Adoption of Supply Chain Management in German Agrifood Networks
: Supply chain management has emerged as cross functional, cross company concept to improve coordination of entire value chains through coordinated actions of all companies. It has...
Melanie Fritz, Eva Schneemann, Gerhard Schiefer
UAI
1997
15 years 8 months ago
Object-Oriented Bayesian Networks
Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applicati...
Daphne Koller, Avi Pfeffer
FMICS
2010
Springer
15 years 7 months ago
Correctness of Sensor Network Applications by Software Bounded Model Checking
We investigate the application of the software bounded model checking tool CBMC to the domain of wireless sensor networks (WSNs). We automatically generate a software behavior mode...
Frank Werner, David Faragó