Sciweavers

14379 search results - page 2592 / 2876
» is 2000
Sort
View
JAR
2000
123views more  JAR 2000»
15 years 6 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
JAR
2000
149views more  JAR 2000»
15 years 6 months ago
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
Patrick Mills, Edward P. K. Tsang
JAR
2000
90views more  JAR 2000»
15 years 6 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter
JASIS
2000
120views more  JASIS 2000»
15 years 6 months ago
Probabilistic datalog: Implementing logical information retrieval for advanced applications
In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Dat...
Norbert Fuhr
JASIS
2000
153views more  JASIS 2000»
15 years 6 months ago
Previews and overviews in digital libraries: Designing surrogates to support visual information seeking
To aid designers of digital library interfaces, we present a framework for the design of information representations in terms of previews and overviews. Previews and overviews are...
Stephan Greene, Gary Marchionini, Catherine Plaisa...
« Prev « First page 2592 / 2876 Last » Next »