430 search results - page 1 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
DATE
2000
IEEE
13 years 10 months ago
2000
IEEE
AMAI
2000
Springer
13 years 9 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
ECAI
2000
Springer
13 years 10 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
JAIR
2007
13 years 5 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
NETWORKS
2008
13 years 5 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...