Sciweavers

8746 search results - page 545 / 1750
» Diversifying search results
Sort
View
LPNMR
2004
Springer
16 years 18 days ago
Answer Set Programming with Clause Learning
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
Jeffrey Ward, John S. Schlipf
147
Voted
SAT
2004
Springer
89views Hardware» more  SAT 2004»
16 years 18 days ago
Using Rewarding Mechanisms for Improving Branching Heuristics
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
Elsa Carvalho, João P. Marques Silva
SAT
2004
Springer
131views Hardware» more  SAT 2004»
16 years 18 days ago
A Comparative Study of 2QBF Algorithms
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
Darsh P. Ranjan, Daijue Tang, Sharad Malik
ICDCSW
2003
IEEE
16 years 16 days ago
Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
Qing Dai, Jie Wu
ICTAI
2003
IEEE
16 years 16 days ago
DOSE: A Distributed Open Semantic Elaboration Platform
The paper proposes a Distributed Open Semantic Elaboration platform based on a modular multilingual enabled architecture, which includes ontology, annotations, lexical entities an...
Dario Bonino, Fulvio Corno, Laura Farinetti