466 search results - page 54 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
144
click to vote
GLVLSI
2005
IEEE
15 years 11 months ago
2005
IEEE
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
171
click to vote
DAC
1999
ACM
15 years 10 months ago
1999
ACM
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
145
click to vote
SAC
2004
ACM
15 years 11 months ago
2004
ACM
In the paper a new data mining algorithm for finding the most interesting dependence rules is described. Dependence rules are derived from the itemsets with support significantly ...
147
click to vote
JGTOOLS
2007
15 years 6 months ago
2007
Relief mapping using the secant method offers an efficient method for adding per pixel height field based displacement to an arbitrary polygonal mesh in real time. The technique...
171
click to vote
EOR
2008
15 years 6 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...