882 search results - page 69 / 177 » Local Search for Very Large SAT Problems |
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We address the problem of automatic object classification for traffic scene surveillance, which is very challenging for the low resolution videos, large intraclass variations and ...
BMCBI
2006
14 years 12 months ago
2006
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
100
click to vote
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...
209
click to vote
NLP
2000
15 years 3 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
103
click to vote
DKE
2002
14 years 11 months ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...