882 search results - page 78 / 177 » Local Search for Very Large SAT Problems |
DBVIS
1993
15 years 4 months ago
1993
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
117
click to vote
CEC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) and a sub-regional harmony search (SHS) are hybridized to obtain DMS-PSO-SHS. A Modified multi-trajectory ...
112
click to vote
BMCBI
2010
14 years 12 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
ECOOP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
109
click to vote
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...