91 search results - page 10 / 19 » Information-theoretic approaches to branching in search |
COR
2007
14 years 9 months ago
2007
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
SIGSOFT
2009
ACM
15 years 4 months ago
2009
ACM
An objective of unit testing is to achieve high structural coverage of the code under test. Achieving high structural coverage of object-oriented code requires desirable method-ca...
MTV
2003
IEEE
15 years 2 months ago
2003
IEEE
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of f...
CG
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
108
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Object localization and classification are important problems in computer vision.
However, in many applications, exhaustive search over all class labels and image
locations is co...