Skip to main content

1 Result(s)

within Computational Mathematics and Numerical Analysis Remove this filter M. Amor Remove this filter Conference Paper Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    A probabilistic model for best-first search B&B algorithms

    In this paper we present a probabilistic model for analysing trees generated during problem solving using best-first search Branch and Bound algorithm. We consider the weight associated with the edges as well ...

    F. Argüello, N. Guil, J. López, M. Amor… in Solving Irregularly Structured Problems in… (1997)