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 12 of 12 for “"Optimal partitions"”.

  1. Optimal partitions for the fast multipole method

    … covering problems leads to new, more efficient partitions for the FMM. New partitions are designed to reduce near-field and far-field calculations. Results from simulations show significant computation time reduction with little to no additional error in many cases.

    gatech Repository record for Optimal partitions for the fast multipole method (opens in a new tab)

  2. Novel Hedonic Games and Stability Notions

    … the computational complexity of finding optimal partitions of agents into coalitions, or finding - or determining the existence of - stable coalition structures. We introduce a new stability notion for hedonic games and examine its relation to core and Nash stability for several classes …

    uky-thes Repository record for Novel Hedonic Games and Stability Notions (opens in a new tab)

  3. Consistency of Modularity Clustering on Random Geometric Graphs

    … clusters is a priori bounded above, the discrete optimal partitions converge in a certain sense to a continuum partition of the underlying domain, characterized as the solution of a type of Kelvin's shape optimization problem.

    arizona-thes Repository record for Consistency of Modularity Clustering on Random Geometric Graphs (opens in a new tab)

  4. How well can one resolve the state space of a chaotic map?

    … overlaps of their widths as the criterion for an optimal partition. The Fokker-Planck evolution is then represented by a finite transition graph, whose spectral determinant yields time averages of dynamical observables. The method applies in principle to both continuous- and discrete-time …

    gatech Repository record for How well can one resolve the state space of a chaotic map? (opens in a new tab)

  5. Partitioning polygons into disjoint axisparallel strips

    … multiple lower bounds on the number of strips in optimal partitions, as well as proving certain properties of optimal solutions. The latter is done by introducing the concept of “switchlines”: lines that separate strip regions of different orientations. Depending on the shape of said lines, it is …

    chalmers Repository record for Partitioning polygons into disjoint axisparallel strips (opens in a new tab)

  6. A distributed workload-aware approach to partitioning geospatial big data for cybergis analytics

    … intensity and dynamic data workload to achieve optimal data partitioning for scalable geospatial applications. Specifically, novel data partitioning algorithms have been developed to support scalable geospatial and temporal data management with new data models designed to represent dynamic data …

    uiuc Repository record for A distributed workload-aware approach to partitioning geospatial big data for cybergis analytics (opens in a new tab)

  7. Decomposing and packing polygons / Dania el-Khechen.

    … time algorithms which given a simple polygon P partitions it, if possible, into two congruent and possibly nonsimple components P 1 and P 2 : an O ( n 2 log n ) time algorithm for properly congruent components and an O ( n 3 ) time algorithm for mirror congruent components. In our analysis of …

    concordia Download PDF for Decomposing and packing polygons / Dania el-Khechen. (opens in a new tab)

  8. Studies in Efficient Discrete Algorithms

    … dynamic programming algorithm for optimal partitions of a complete edge-weighted graph, where the edges are weighted by the length of the unique shortest path connecting those vertices in the a priori given tree (shortest path metric induced by a tree). Our result resolves, in …

    lund Repository record for Studies in Efficient Discrete Algorithms (opens in a new tab) Download PDF for Studies in Efficient Discrete Algorithms (opens in a new tab)

  9. Η μέθοδος collocation για παραβολικές μερικές διαφορικές εξισώσεις με ασυνεχή συντελεστή διάχυσης: στην κατεύθυνση προσομοίωσης καρκινικών όγκων εγκεφάλου

    … and studied the conditions which guarantee the optimal convergence of iterative methods for solving the corresponding algebraic system by means of the theory of p-cyclic matrices. At the same time spectral quantities are associated with the initial data of the model for the a priori …

    greece Repository record for Η μέθοδος collocation για παραβολικές μερικές διαφορικές εξισώσεις με ασυνεχή συντελεστή διάχυσης: στην κατεύθυνση προσομοίωσης καρκινικών όγκων εγκεφάλου (opens in a new tab)

  10. Multi-agent, multi-objective path planning in complex environments

    … the agent plans, follows, and replans the optimal path by assigning edge weights that balance exploration and exploitation, given the current knowledge of the environment. We illustrate our strategy on the setting of an agent operating in a gridwold environment. In the second part, we …

    uiuc Repository record for Multi-agent, multi-objective path planning in complex environments (opens in a new tab)

  11. Στατιστική θεωρία πληροφοριών και censoring

    The contribution of the thesis lies in the definition of new information measures in the context of censoring (random censoring, quantal random censoring), which results from classical information measures, and the study of various properties of the statistical information theory and new properties …

    greece Repository record for Στατιστική θεωρία πληροφοριών και censoring (opens in a new tab)