#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1982

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Henry W. Davis, Anna Bramanti-Gregor, Jin Wang
- ISMIS
- 1988

- Stephen V. Chenoweth, Henry W. Davis
- IJCAI
- 1991

In high-performance A* searching to solve satisfici n g prob lems, there is a c r i t i ca l need to design heur is t ics which cause low t ime-complex i ty . In order for humans or machines to do this effectively, there mus t be an unders tand ing of the domainindependent properties that such heurist ics have. We snow that , contrary to common belief,… (More)

- Timothy Humphrey, Anna Bramanti-Gregor, Henry W. Davis
- AI*IA
- 1995

- Henry W. Davis, Randy B. Pollack, Thomas Sudkamp
- AAAI
- 1984

Three admissible bidirectional search algorithms have been described in the literature: A Cartesian product approach due to Doran, Pohl's BHPA, and Champeaux and Sint's BHFFA2. This paper describes an algorithm, GP, which contains the latter two and others. New admissibility results are obtained. A first order analysis is made comparing the run times of… (More)

- Anna Bramanti-Gregor, Henry W. Davis
- IJCAI
- 1993

- Anna Bramanti-Gregor, Henry W. Davis
- IJCAI
- 1991

A method is presented that causes A* to return high quality solutions whi le solving a set of problems using a non-admissible heuristic. The heuristic gu id ing the search changes as new informat ion is learned dur ing the search, and it converges to an admissible heuristic wh ich 'contains the insight ' of the or ig ina l nonadmissible one. After a finite… (More)

- Henry W. Davis, Stephen V. Chenoweth
- Annals of Mathematics and Artificial Intelligence
- 1992

Two models of heuristics have been suggested in previous studies of A* tree-searching. The models are used to determine what mathematical properties heuristics must have if A* is to have polynomial, versus exponential, average asymptotic time complexity. In the EC model polynomial A* complexity is associated with logarithmic heuristic error. In the NC model… (More)

- Henry W. Davis
- J. ACM
- 1990

Pearl has shown that, in admissible A* tree-searching, the expected number of nodes expanded is bounded above and below by exponential functions of heuristic error. An additional assumption required for the validity of Pearl's argument is given. The assumption's significance and interpretation are discussed.

- Stephen V. Chenoweth, Henry W. Davis
- Annals of Mathematics and Artificial Intelligence
- 1992

Previous studies of A* tree-searching have modeled heuristics as random variables. The average number of nodes expanded is expressed asymptotically in terms of distance to goal. The conclusion reached is that A* complexity is an exponential function of heuristic error: Polynomial error implies exponential complexity and logarithmic accuracy is required for… (More)

- Anna Bramanti-Gregor, Henry W. Davis, F. G. Ganschow
- ECAI
- 1992