430 search results - page 11 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
PR
2006
14 years 10 months ago
2006
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
DATE
2000
IEEE
15 years 2 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
105
click to vote
AI
2001
Springer
15 years 2 months ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
WALCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
161
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...