Expected search duration for finite backtracking adaptive search

Author： Alexander D.L.J.   Bulger D.W.   Wood G.R.  

Publisher： Elsevier

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.47, Iss.2, 2003-07, pp. : 78-86

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Backtracking Adaptive Search: Distribution of Number of Iterations to Convergence

By Wood G.   Bulger D.   Baritompa W.   Alexander D.  

Journal of Optimization Theory and Applications, Vol. 128, Iss. 3, 2006-03 ,pp. : 547-562

Springer Publishing Company

Access to resources Recommend Favorite

Task structure and the apparent duration of hierarchical search

By Tractinsky N.   Meyer J.  

International Journal of Human-Computer Studies, Vol. 55, Iss. 5, 2001-11 ,pp. : 845-860

Academic Press

Access to resources Recommend Favorite

A new hybridized backtracking search optimization algorithm with differential evolution for sidelobe suppression of uniformly excited concentric circular antenna arrays

By  

INTERNATIONAL JOURNAL OF RF AND MICROWAVE COMPUTER-AIDED ENGINEERING (ELECTRONIC), Vol. 25, Iss. 3, 2015-03 ,pp. : 262-268

John Wiley & Sons Inc

Access to resources Recommend Favorite

Implementing Pure Adaptive Search with Grover's Quantum Algorithm

By Bulger D.   Baritompa W.P.   Wood G.R.  

Journal of Optimization Theory and Applications, Vol. 116, Iss. 3, 2003-03 ,pp. : 517-529

Springer Publishing Company

Access to resources Recommend Favorite

Solving Hierarchical Constraints over Finite Domains with Local Search

By Henz Martin  

Annals of Mathematics and Artificial Intelligence, Vol. 40, Iss. 3-4, 2004-03 ,pp. : 283-301

Springer Publishing Company

Access to resources Recommend Favorite