882 search results - page 72 / 177 » Local Search for Very Large SAT Problems |
ISSRE
2002
IEEE
15 years 4 months ago
2002
IEEE
Formal analysis of software is a powerful analysis tool, but can be too costly. Random search of formal models can reduce that cost, but is theoretically incomplete. However, rand...
103
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
COCOON
2009
Springer
15 years 6 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
CIKM
2005
Springer
15 years 5 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
113
click to vote
ACCV
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents an efficient indexing and retrieval scheme for searching in document image databases. In many non-European languages, optical character recognizers are not very...