Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Algorithm Use"”.

  1. Extracting the K best solutions from a valued and-or acyclic graph

    … Some model-based estimators, such as the MEXEC algorithm and the DNNF-based Belief State Estimation algorithm, use a valued and-or acyclic graph to represent the possible estimates. These algorithms specifically use a valued smooth deterministic decomposable negation normal form (sd-DNNF) …

    mit Repository record for Extracting the K best solutions from a valued and-or acyclic graph (opens in a new tab)

  2. A design tool architecture for the rapid evaluation of product design tradeoffs in an Inernet-based system modeling environment

    … consists of a multi- objective evolutionary algorithm developed at the Ecole Polytechnique F6d6rale de Lausanne. The first part of this thesis provides a comprehensive survey of all topics relevant to this work. Traditional product development is discussed along with some of the challenges …

    mit Repository record for A design tool architecture for the rapid evaluation of product design tradeoffs in an Inernet-based system modeling environment (opens in a new tab)

  3. Algorithm Versus Human Expert Recommendations Preferences in Decision Support: Two Essays

    Algorithms refer to the software programs designed to support problem solving in a wide range of decision domains. Given the Artificial Intelligence (AI) revolution, algorithms have become an integral part of our personal, social, and professional lives. As technology rapidly advances, these …

    vt Repository record for Algorithm Versus Human Expert Recommendations Preferences in Decision Support: Two Essays (opens in a new tab)

  4. Issues of Real Time Information Retrieval in Large, Dynamic and Heterogeneous Search Spaces

    … dynamic resource allocation, we propose to use a partial processing approach that uses anytime algorithms to process the documents in multiple steps. At each successive step, a more accurate approximation of the final similarity values of the documents is produced. Resource allocation …

    vt Repository record for Issues of Real Time Information Retrieval in Large, Dynamic and Heterogeneous Search Spaces (opens in a new tab)