Average-case analysis of best-first search in two representative directed acyclic graphs
暂无分享,去创建一个
[1] W. Townsend. The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution , 1978 .
[2] Vipin Kumar,et al. Search in Artificial Intelligence , 1988, Symbolic Computation.
[3] Ramkumar Ramaswamy,et al. Searching graphs with A*: applications to job sequencing , 1996, IEEE Trans. Syst. Man Cybern. Part A.
[4] Robijn Bruinsma,et al. Soft order in physical systems , 1994 .
[5] Mandell Bellmore,et al. Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..
[6] Weixiong Zhang,et al. An average-case analysis of graph search , 2002, AAAI/IAAI.
[7] Richard M. Karp,et al. Searching for an Optimal Path in a Tree with Random Costs , 1983, Artif. Intell..
[8] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[9] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .
[10] Hermann Kaindl,et al. How to Use Limited Memory in Heuristic Search , 1995, IJCAI.
[11] Stephen V. Chenoweth,et al. High-performance A* search using rapidly growing heuristics , 1991, IJCAI 1991.
[12] Rina Dechter,et al. Generalized best-first search strategies and the optimality of A* , 1985, JACM.
[13] D. Lipman,et al. The multiple sequence alignment problem in biology , 1988 .
[14] Richard E. Korf,et al. Performance of Linear-Space Search Algorithms , 1995, Artif. Intell..
[15] E. Balas,et al. Branch and Bound Methods for the Traveling Salesman Problem , 1983 .
[16] Hiroshi Imai,et al. Enhanced A* Algorithms for Multiple Alignments: Optimal Alignments for Several Sequences and k-Opt Approximate Alignments for Large Cases , 1999, Theoretical Computer Science.
[17] Alexander Reinefeld,et al. Enhanced Iterative-Deepening Search , 1994, IEEE Trans. Pattern Anal. Mach. Intell..
[18] Amitava Bagchi,et al. Average-case analysis of heuristic search in tree-like networks , 1988 .
[19] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[20] Richard E. Korf,et al. Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment , 2000, AAAI/IAAI.
[21] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[22] Weixiong Zhang,et al. Depth-First Branch-and-Bound versus Local Search: A Case Study , 2000, AAAI/IAAI.
[23] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[24] C. McDiarmid,et al. Probabilistic analysis of tree search , 1990 .
[25] Jesfis Peral,et al. Heuristics -- intelligent search strategies for computer problem solving , 1984 .
[26] Gregory M. Provan,et al. An Expected-Cost Analysis of Backtracking and Non-Backtracking Algorithms , 1991, IJCAI.
[27] Richard E. Korf,et al. Time complexity of iterative-deepening-A* , 2001, Artif. Intell..
[28] Amitava Bagchi,et al. Graph Search Methods for Non-Order-Preserving Evaluation Functions: Applications to Job Sequencing Problems , 1996, Artif. Intell..
[29] Stephen P. Boyd,et al. Branch and Bound Methods , 1987 .
[30] Emil Grosswald,et al. The Theory of Partitions , 1984 .
[31] Henry W. Davis,et al. Cost-error relationships in A* tree-searching , 1990, JACM.
[32] Rina Dechter,et al. Probabilistic Analysis of the Complexity of A* , 1980, Artif. Intell..
[33] Jan Karel Lenstra,et al. Technical Note - On the Expected Performance of Branch-and-Bound Algorithms , 1978, Oper. Res..