882 search results - page 129 / 177 » Local Search for Very Large SAT Problems |
126
click to vote
AAAI
1998
15 years 5 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
138
click to vote
CP
2001
Springer
15 years 8 months ago
2001
Springer
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
171
click to vote
PAA
2002
15 years 3 months ago
2002
: Many classification problems involve high dimensional inputs and a large number of classes. Multiclassifier fusion approaches to such difficult problems typically centre around s...
126
click to vote
ICCAD
2008
IEEE
16 years 22 days ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
121
click to vote
TEC
2002
15 years 3 months ago
2002
We investigate the application of genetic algorithms (GAs) for recognizing real two-dimensional (2-D) or three-dimensional (3-D) objects from 2-D intensity images, assuming that th...