Sciweavers

40 search results - page 2 / 8
» Optimizations for Compiling Declarative Models into Boolean ...
Sort
View
JAIR
2006
87views more  JAIR 2006»
13 years 5 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy
CC
2010
Springer
282views System Software» more  CC 2010»
13 years 3 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
PVLDB
2008
134views more  PVLDB 2008»
13 years 4 months ago
Evita raced: metacompilation for declarative networks
Declarative languages have recently been proposed for many new applications outside of traditional data management. Since these are relatively early research efforts, it is import...
Tyson Condie, David Chu, Joseph M. Hellerstein, Pe...
AAAI
2010
13 years 5 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher
TVCG
2010
194views more  TVCG 2010»
13 years 3 months ago
Declarative Language Design for Interactive Visualization
Abstract—We investigate the design of declarative, domain-specific languages for constructing interactive visualizations. By separating specification from execution, declarativ...
Jeffrey Heer, Michael Bostock