Sciweavers

1302 search results - page 98 / 261
» Free-Style Theorem Proving
Sort
View
TON
2010
101views more  TON 2010»
15 years 2 months ago
Deploying sensor networks with guaranteed fault tolerance
—We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (k-connectivity) between all nodes. Such a guarante...
Jonathan Bredin, Erik D. Demaine, Mohammad Taghi H...
COLT
2010
Springer
15 years 2 months ago
Learning to Create is as Hard as Learning to Appreciate
We explore the relationship between a natural notion of unsupervised learning studied by Kearns et al. (STOC '94), which we call here "learning to create" (LTC), an...
David Xiao
LICS
2010
IEEE
15 years 2 months ago
A Sound and Complete Calculus for Finite Stream Circuits
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
Stefan Milius
LPAR
2010
Springer
15 years 2 months ago
Counting and Enumeration Problems with Bounded Treewidth
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
PTS
2010
175views Hardware» more  PTS 2010»
15 years 2 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch