313 search results - page 14 / 63 » Complete Local Search with Memory |
UAI
2003
13 years 11 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
JAIR
2011
2011
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
13 years 21 days 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 ...
MICRO
1997
IEEE
14 years 2 months ago
1997
IEEE
As the disparity between processor and main memory performance grows, the number of execution cycles spent waiting for memory accesses to complete also increases. As a result, lat...
ETS
2007
IEEE
14 years 4 months ago
2007
IEEE
An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. Therefore embedded memories are commonly equipped with spare r...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
In this paper, phase combinations among martensitic variants in shape memory alloys patches and bars are simulated by a hybrid optimization methodology. The mathematical model is ...