-
1
-
-
80053271756
-
A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem
-
R. Bayardo and D. Miranker. A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem. In AAAI'96, 1996.
-
(1996)
AAAI'96
-
-
Bayardo, R.1
Miranker, D.2
-
3
-
-
80053290155
-
On finding minimal w-cutset problem
-
B. Bidyuk and R. Dechter. On finding minimal w-cutset problem. In UAI'04, 2004.
-
(2004)
UAI'04
-
-
Bidyuk, B.1
Dechter, R.2
-
4
-
-
0035250750
-
Recursive conditioning
-
DOI 10.1016/S0004-3702(00)00069-2
-
A. Darwiche. Recursive conditioning. Artificial Intelligence Journal, 125(1-2):5-41, 2001. (Pubitemid 32196230)
-
(2001)
Artificial Intelligence
, vol.126
, Issue.1-2
, pp. 5-41
-
-
Darwiche, A.1
-
5
-
-
33646197085
-
Mixtures of deterministic-probabilistic networks and their AND/OR search space
-
R. Dechter and R. Mateescu. Mixtures of deterministic-probabilistic networks and their AND/OR search space. In UAI'04, 2004.
-
(2004)
UAI'04
-
-
Dechter, R.1
Mateescu, R.2
-
6
-
-
0025228149
-
Enhancement schemes for constraint processing. Backjumping, learning, and cutset decomposition
-
DOI 10.1016/0004-3702(90)90046-3
-
R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence, 41:273-312, 1990. (Pubitemid 20647477)
-
(1990)
Artificial Intelligence
, vol.41
, Issue.3
, pp. 273-312
-
-
Dechter, R.1
-
7
-
-
0033188982
-
Bucket elimination: A unifying framework for reasoning
-
DOI 10.1016/S0004-3702(99)00059-4
-
R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, pages 41-85, 1999. (Pubitemid 30542742)
-
(1999)
Artificial Intelligence
, vol.113
, Issue.1
, pp. 41-85
-
-
Dechter, R.1
-
8
-
-
0038558013
-
Exact genetic linkage computations for general pedigrees
-
M. Fishelson and D. Geiger. Exact genetic linkage computations for general pedigrees. Bioinformatics, 18(1):189-198, 2002.
-
(2002)
Bioinformatics
, vol.18
, Issue.1
, pp. 189-198
-
-
Fishelson, M.1
Geiger, D.2
-
9
-
-
0003815444
-
Taking advantage of stable sets of variables in constraint satisfaction problems
-
E. C. Freuder and M. J. Quinn. Taking advantage of stable sets of variables in constraint satisfaction problems. In IJCAI'85, 1985.
-
(1985)
IJCAI'85
-
-
Freuder, E.C.1
Quinn, M.J.2
-
11
-
-
84880755023
-
Boosting search with variable-elimination
-
J. Larrosa and R. Dechter. Boosting search with variable-elimination. Constraints, pages 407-419, 2002.
-
(2002)
Constraints
, pp. 407-419
-
-
Larrosa, J.1
Dechter, R.2
-
13
-
-
0034140791
-
Resolution versus search: two strategies for SAT
-
I. Rish and R. Dechter. Resolution vs. search; two strategies for sat. Journal of Automated Reasoning, 24(1/2):225-275, 2000. (Pubitemid 30576102)
-
(2000)
Journal of Automated Reasoning
, vol.24
, Issue.1-2
, pp. 225-275
-
-
Rish, I.1
Dechter, R.2
|