Sciweavers

504 search results - page 66 / 101
» The Complexity of Symmetry-Breaking Formulas
Sort
View
JSAT
2008
85views more  JSAT 2008»
13 years 10 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
ET
2007
123views more  ET 2007»
13 years 10 months ago
Defect-tolerant Logic with Nanoscale Crossbar Circuits
Crossbar architectures are one approach to molecular electronic circuits for memory and logic applications. However, currently feasible manufacturing technologies introduce numero...
Tad Hogg, Greg Snider
JANCL
2007
86views more  JANCL 2007»
13 years 10 months ago
Constructive knowledge: what agents can achieve under imperfect information
We propose a non-standard interpretation of Alternating-time Temporal Logic with imperfect information, for which no commonly accepted semantics has been proposed yet. Rather than ...
Wojciech Jamroga, Thomas Ågotnes
MOC
2000
69views more  MOC 2000»
13 years 9 months ago
Evaluating higher derivative tensors by forward propagation of univariate Taylor series
This article considers the problem of evaluating all pure and mixed partial derivatives of some vector function defined by an evaluation procedure. The natural approach to evaluati...
Andreas Griewank, Jean Utke, Andrea Walther
CORR
1998
Springer
105views Education» more  CORR 1998»
13 years 9 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas