Sciweavers

1278 search results - page 33 / 256
» The Complexity of Weighted Boolean
Sort
View
JELIA
2010
Springer
13 years 6 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
ICCAD
2010
IEEE
156views Hardware» more  ICCAD 2010»
13 years 5 months ago
Boolean matching of function vectors with strengthened learning
Boolean matching for multiple-output functions determines whether two given (in)completely-specified function vectors can be identical to each other under permutation and/or negat...
Chih-Fan Lai, Jie-Hong R. Jiang, Kuo-Hua Wang
DCG
2010
132views more  DCG 2010»
13 years 7 months ago
Delaunay Refinement for Piecewise Smooth Complexes
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...
Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos
JUCS
2006
107views more  JUCS 2006»
13 years 7 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
MEMOCODE
2008
IEEE
14 years 2 months ago
Bisimulator 2.0: An On-the-Fly Equivalence Checker based on Boolean Equation Systems
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...
Radu Mateescu, Emilie Oudot