466 search results - page 74 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
131
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
163
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as ...
160
click to vote
ADBIS
2009
Springer
15 years 3 months ago
2009
Springer
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
138
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
Object oriented languages, in particular Java, use a frequent dynamic dispatch mechanism to search for the definition of an invoked method. A method could be defined in more than...
143
click to vote
DATE
2008
IEEE
16 years 14 days ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...