244 search results - page 15 / 49 » A Linear Search Strategy using Bounds |
IMA
2007
Springer
14 years 2 months ago
2007
Springer
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear appro...
CP
2009
Springer
14 years 9 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
EWCBR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
INFORMS
2010
13 years 7 months ago
2010
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
AAAI
2007
13 years 11 months ago
2007
The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to ...