1029 search results - page 14 / 206 » Local Minima Embedding |
JAIR
2011
2011
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
14 years 2 months ago
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
STOC
2007
ACM
16 years 2 days ago
2007
ACM
ICAI
2008
15 years 1 months ago
2008
: This paper presents a new approach to equalization of communication channels using Artificial Neural Networks (ANNs). A novel method of training the ANNs using Tabu based Back Pr...
114
click to vote
SCIA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Solutions to non-linear least squares problems play an essential role in structure and motion problems in computer vision. The predominant approach for solving these prob...
74
Voted
AAAI
1994
15 years 1 months ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...