Skip to main content

2 Result(s)

within Conference Paper Remove this filter M. Amor Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    A Data Parallel Formulation of the Barnes-Hut Method for N-Body Simulations

    This paper presents a data-parallel formulation for N-body simulations using the Barnes-Hut method. The tree-structured problem is first linearized by using space-filling curves. This process allows us to use sta...

    M. Amor, F. Argüello, J. López, O. Plata… in Applied Parallel Computing. New Paradigms … (2001)

  2. 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)