Sciweavers

1376 search results - page 157 / 276
» Searching Trees: An Essay
Sort
View
CP
2009
Springer
16 years 7 months ago
An Interpolation Method for CLP Traversal
We consider the problem of exploring the search tree of a CLP goal in pursuit of a target property. Essential to such a process is a method of tabling to prevent duplicate explorat...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
SAT
2004
Springer
89views Hardware» more  SAT 2004»
15 years 11 months 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
ICDCSW
2003
IEEE
15 years 11 months 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
ECAI
2006
Springer
15 years 10 months ago
Last Conflict Based Reasoning
In this paper, we propose an approach to guide search to sources of conflicts. The principle is the following: the last variable involved in the last conflict is selected in priori...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
BIBM
2009
IEEE
113views Bioinformatics» more  BIBM 2009»
15 years 9 months ago
Fast Motif Selection for Biological Sequences
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
Pavel P. Kuksa, Vladimir Pavlovic