Sciweavers

1795 search results - page 310 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
DNA
2000
Springer
132views Bioinformatics» more  DNA 2000»
14 years 2 months ago
Engineered Communications for Microbial Robotics
Multicellular organisms create complex patterned structures from identical, unreliable components. Learning how to engineer such robust behavior is important to both an improved un...
Ron Weiss, Thomas F. Knight Jr.
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 10 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
DT
2000
88views more  DT 2000»
13 years 9 months ago
Postsilicon Validation Methodology for Microprocessors
f abstraction as applicable to break the problem's complexity, and innovating better techniques to address complexity of new microarchitectural features. Validation techniques...
Hemant G. Rotithor
ICDE
2003
IEEE
139views Database» more  ICDE 2003»
14 years 11 months ago
Super-Fast XML Wrapper Generation in DB2: A Demonstration
The XML Wrapper is a new feature of the federated database capabilities of DB2/UDB v8. It enables users and applications to issue SQL queries against XML data from a variety of so...
Vanja Josifovski, Sabine Massmann, Felix Naumann
SIGSOFT
2007
ACM
14 years 10 months ago
Parallel test generation and execution with Korat
We present novel algorithms for parallel testing of code that takes structurally complex test inputs. The algorithms build on the Korat algorithm for constraint-based generation o...
Sasa Misailovic, Aleksandar Milicevic, Nemanja Pet...