Sciweavers

10997 search results - page 76 / 2200
» On the Structure of Complete Sets
Sort
View
CP
2010
Springer
15 years 4 months ago
A Complete Multi-valued SAT Solver
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
Siddhartha Jain, Eoin O'Mahony, Meinolf Sellmann
WADT
1998
Springer
15 years 10 months ago
Complete Strategies for Term Graph Narrowing
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
Annegret Habel, Detlef Plump
ICCV
2009
IEEE
16 years 10 months ago
Tensor completion for estimating missing values in visual data
In this paper we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process, or because the ...
Ji Liu, Przemyslaw Musialski, Peter Wonka, Jieping...
PERCOM
2009
ACM
16 years 20 days ago
Delaunay-Triangulation Based Complete Coverage in Wireless Sensor Networks
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...
Chinh T. Vu, Yingshu Li
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
16 years 9 days ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...