91 search results - page 3 / 19 » Information-theoretic approaches to branching in search |
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
ATVA
2007
Springer
14 years 6 hour ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
GECCO
2007
Springer
13 years 12 months ago
2007
Springer
There has been a considerable body of work on search–based test data generation for branch coverage. However, hitherto, there has been no work on multi–objective branch covera...
TIME
2005
IEEE
13 years 11 months ago
2005
IEEE
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...
APLAS
2007
ACM
13 years 9 months ago
2007
ACM
The integration of functional and logic programming is a well developed field of research. We discuss that the integration could be improved significantly in two separate aspects: ...