Add to ORKGCicalese F, Jacobs T, Laber ES, Molinaro M. On the Complexity of Searching in Trees: Average-case Minimization. 2009
Abstract # of nodes generated Motivated by an anomaly in branch-and-bound (BnB) search, we analyze i...
We address the extension of the binary search technique from sorted arrays and totally ordered sets ...
Abstract. The weighted path length of optimum binary search trees is bounded above by Y’./3i +2 a. +...
The well known binary search method can be described as the process of identifying some marked node ...
We discuss several simple strategies for constructing binary search trees. Upper and lower bounds fo...
We study the following tree search problem: in a given tree T = (V , E) a vertex has been marked and...
Summary We discuss two simple strategies for constructing binary search trees: Place the most frequ...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-08-04T13:14:30Z No. of bitstreams:...
This paper closes a gap in the foundations of the theory of average case complexity. First, we clari...
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth min...
Many important problems in operations research, artificial intelligence, combinatorial algorithms, a...
We study the problem of minimizing the weighted average number of queries to identify an initially u...
AbstractIn (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and...
. This paper closes a gap in the foundations of the theory of average case complexity. First, we cla...
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth min...
Abstract # of nodes generated Motivated by an anomaly in branch-and-bound (BnB) search, we analyze i...
We address the extension of the binary search technique from sorted arrays and totally ordered sets ...
Abstract. The weighted path length of optimum binary search trees is bounded above by Y’./3i +2 a. +...
The well known binary search method can be described as the process of identifying some marked node ...
We discuss several simple strategies for constructing binary search trees. Upper and lower bounds fo...
We study the following tree search problem: in a given tree T = (V , E) a vertex has been marked and...
Summary We discuss two simple strategies for constructing binary search trees: Place the most frequ...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-08-04T13:14:30Z No. of bitstreams:...
This paper closes a gap in the foundations of the theory of average case complexity. First, we clari...
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth min...
Many important problems in operations research, artificial intelligence, combinatorial algorithms, a...
We study the problem of minimizing the weighted average number of queries to identify an initially u...
AbstractIn (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and...
. This paper closes a gap in the foundations of the theory of average case complexity. First, we cla...
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth min...
Abstract # of nodes generated Motivated by an anomaly in branch-and-bound (BnB) search, we analyze i...
We address the extension of the binary search technique from sorted arrays and totally ordered sets ...
Abstract. The weighted path length of optimum binary search trees is bounded above by Y’./3i +2 a. +...