2457 search results - page 222 / 492 » Local Search with Bootstrapping |
156
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
181
click to vote
EVOW
2009
Springer
15 years 10 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
168
click to vote
AUSAI
2007
Springer
15 years 10 months ago
2007
Springer
Many real-world problems are over-constrained and require search techniques adapted to optimising cost functions rather than searching for consistency. This makes the MAX-SAT probl...
157
click to vote
ERCIMDL
2006
Springer
15 years 9 months ago
2006
Springer
Peer-to-peer networks have been identified as promising architectural concept for developing search scenarios across digital library collections. Digital libraries typically offer ...
166
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
The structure of a Markov network is typically learned using top-down search. At each step, the search specializes a feature by conjoining it to the variable or feature that most ...