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 “"dependency discovery"”.

  1. Dependency discovery for data integration

    … In this thesis we propose algorithms for dependency discovery to provide necessary information for data integration. We focus on inclusion dependencies (INDs) in general and a special form named conditional inclusion dependencies (CINDs): (i) INDs enable the discovery of structure in a …

    potsdam-diss Repository record for Dependency discovery for data integration (opens in a new tab)

  2. Design and implementation of an automated battery management platform

    … developed approach called Incremental Feature Dependency Discovery (iFDD) by allowing to use caches from computer science literature to make conversion from basic features to extended features faster. By doing so, this method significantly reduces the computational complexity.

    mit Repository record for Design and implementation of an automated battery management platform (opens in a new tab)

  3. Practical reinforcement learning using representation learning and safe exploration for large scale Markov decision processes

    … this thesis introduces incremental Feature Dependency Discovery (iFDD) as a representation expansion method with cheap per-timestep computational complexity that can be combined with any online, value-based reinforcement learning using binary features. In addition to convergence and …

    mit Repository record for Practical reinforcement learning using representation learning and safe exploration for large scale Markov decision processes (opens in a new tab)

  4. Multiagent planning and learning using random decompositions and adaptive representations

    … nature of the problem and the exponential dependency of the planning space on the number of agents render many of the existing algorithms practically infeasible for real-life applications. A standard approach to improve the scalability of planning algorithms is to take advantage of the …

    mit Repository record for Multiagent planning and learning using random decompositions and adaptive representations (opens in a new tab)