Sciweavers

4708 search results - page 778 / 942
» Generating the Structure of Argument
Sort
View
CORR
2008
Springer
142views Education» more  CORR 2008»
15 years 4 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 4 months ago
A computationally-efficient construction for the matrix-based key distribution in sensor network
Key pre-distribution in wireless sensor network is aimed at delivering keys to sensor networks at the low expense of computation, communication, and memory while providing a high d...
Abedelaziz Mohaisen
ECCC
2010
95views more  ECCC 2010»
15 years 4 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola
DM
2008
112views more  DM 2008»
15 years 4 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
AIEDU
2006
77views more  AIEDU 2006»
15 years 4 months ago
Constraint-based Modeling and Ambiguity
Constraint-based modeling has been used in many application areas of Intelligent Tutoring Systems as a powerful means to analyse erroneous student solutions and generate helpful fe...
Wolfgang Menzel