Sciweavers

170 search results - page 7 / 34
» Relevance Cuts: Localizing the Search
Sort
View
ECAI
2008
Springer
13 years 9 months ago
Justification-Based Non-Clausal Local Search for SAT
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
Matti Järvisalo, Tommi A. Junttila, Ilkka Nie...
ICML
2005
IEEE
14 years 8 months ago
Robust one-class clustering using hybrid global and local search
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
Gunjan Gupta, Joydeep Ghosh
SIGIR
2002
ACM
13 years 7 months ago
Effective collection metasearch in a hierarchical environment: global vs. localized retrieval performance
We compare standard global IR searching with user-centric localized techniques to address the database selection problem. We conduct a series of experiments to compare the retriev...
Jack G. Conrad, Changwen Yang, Joanne S. Claussen
JSAT
2010
132views more  JSAT 2010»
13 years 2 months ago
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
Federico Heras, David Bañeres
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
14 years 4 months ago
Fixed-outline Floorplanning through Better Local Search
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
Saurabh N. Adya, Igor L. Markov