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 20 of 722 for “"Maximization"”.

  1. On two utility maximization problems

    This dissertation studies two expected utility maximization problems from mathematical finance. The first project (Chapter 2) deals with a single-agent utility maximization under constraints on intertemporal consumption; the second project (Chapter 3) studies Nash equilibria in an N-player game of …

    texas Repository record for On two utility maximization problems (opens in a new tab)

  2. Planar detection using modified expectation maximization

    … motivates the employment of the Expectation Maximization (EM) algorithm. Derivation of the EM algorithm equations proves that a closed form solution to the maximization step is impractical which leads to the proposal of a Modified Expectation Maximization (MEM) algorithm. The MEM algorithm …

    missouri Repository record for Planar detection using modified expectation maximization (opens in a new tab)

  3. Alignment by maximization of mutual information

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.

    mit Repository record for Alignment by maximization of mutual information (opens in a new tab)

  4. Bayesian Expectation-Maximization-Maximization: a latent-mixture-modeling-based Bayesian algorithm for the three-parameter logistic model

    The current study proposes a Bayesian Expectation-Maximization-Maximization (Bayesian EMM, or BEMM), which is an alternative feasible Bayesian algorithm for the three-parameter logistic model (3PLM). The Bayesian EMM takes full advantage of both the EMM and the Bayesian approach. The BEMM not only …

    uiuc Repository record for Bayesian Expectation-Maximization-Maximization: a latent-mixture-modeling-based Bayesian algorithm for the three-parameter logistic model (opens in a new tab)

  5. Energy-efficient relay cooperation for lifetime maximization

    … power allocation among relays for lifetime maximization in a dual-hop relay network operated by amplify-and-forward relays with battery limitations. Power allocation algorithms are proposed for three different scenarios. First, we study the relay cooperation case where all the relays jointly …

    uoit Repository record for Energy-efficient relay cooperation for lifetime maximization (opens in a new tab)

  6. Sum-rate maximization for two-way active channels.

    … channel is reciprocal, we consider the sum-rate maximization problem under the assumption that the powers of transceivers as well as the channel power are limited. The goal is to jointly optimize the power of each subchannel as well as the allocated power by each transceiver to each subchannel. …

    uoit Repository record for Sum-rate maximization for two-way active channels. (opens in a new tab)

  7. Quadratic maximization under combinatorial constraints and related applications

    … Component Analysis (PCA), we study quadratic maximization problems subject to sparsity, nonnegativity and other combinatorial constraints. Intuitively, a key technical challenge is determining the support of the optimal solution. We develop a method that can surprisingly solve the maximization

    texas Repository record for Quadratic maximization under combinatorial constraints and related applications (opens in a new tab)

  8. Choice Overload and Maximization: Implications for Disordered Gambling

    … slot machines, a possible behavioral marker of maximization. The results demonstrated that maximizers switched among available slot machines significantly more frequently than satisficers. Experiment II investigated further links between gambling behavior and maximization. A significant …

    siu-theses Repository record for Choice Overload and Maximization: Implications for Disordered Gambling (opens in a new tab)

  9. Profit maximization of a kanban-based supply chain

    In this paper, we propose a stochastic method to model a multi-stage Kanban-based supply chain, constructed strictly under the JIT philosophy.This model decides the optimum number of Kanban with a trade-off between inventory cost and customer service level.After developing this model, we implement …

    missouri Repository record for Profit maximization of a kanban-based supply chain (opens in a new tab)

  10. Scheduling algorithms for throughput maximization in data networks

    This thesis considers the performance implications of throughput optimal scheduling in physically and computationally constrained data networks. We study optical networks, packet switches, and wireless networks, each of which has an assortment of features and constraints that challenge the design …

    mit Repository record for Scheduling algorithms for throughput maximization in data networks (opens in a new tab)

  11. Learning-NUM: Utility Maximization in Stochastic Queueing Networks

    Network Utility Maximization (NUM) studies the problems of allocating traffic rates to network users in order to maximize the users’ total utility subject to network resource constraints. We propose a new paradigm of utility maximization in stochastic queueing networks where the utility functions …

    mit Repository record for Learning-NUM: Utility Maximization in Stochastic Queueing Networks (opens in a new tab)

  12. From expectation-3-maximization to bayesian expectation-3-maximization: A latent mixture modeling-based bayesian algorithm for the 4-parameter logistic model

    … modeling view and developed the Expectation-Maximization-Maximization-Maximization (EMMM) method. Combining the EMMM with the Bayesian approach, allowed the Bayesian Expectation-Maximization-Maximization-Maximization (BEMMM) algorithm to be proposed. First, the author compared the EMMM with …

    uiuc Repository record for From expectation-3-maximization to bayesian expectation-3-maximization: A latent mixture modeling-based bayesian algorithm for the 4-parameter logistic model (opens in a new tab)

  13. Advancing Community Detection through Ensemble Learning and Modularity Maximization

    Arguably, the most fundamental problem in Network Science is finding structure within a complex network. Often, this is done by partitioning the network's nodes into communities in a way that maximizes an objective function. However, finding the maximizing partition is generally a computationally …

    houston Repository record for Advancing Community Detection through Ensemble Learning and Modularity Maximization (opens in a new tab)

  14. Testing the Behavior Implications of Profit Maximization in Manufacturingfirms

    Made available in DSpace on 2014-12-09T19:32:16Z (GMT). No. of bitstreams: 1 7000796.pdf: 3145277 bytes, checksum: 7a9142e2a180747acffffce16122b43e (MD5) Previous issue date: 1969

    uiuc Repository record for Testing the Behavior Implications of Profit Maximization in Manufacturingfirms (opens in a new tab)

  15. Real-time trajectory optimization for excavators by power maximization

    … validated the method. It was shown that power maximization as a strategy of trajectory adaptation for excavation was both well-grounded and feasible.

    mit Repository record for Real-time trajectory optimization for excavators by power maximization (opens in a new tab)

  16. Mechanism design : from optimal transport theory to revenue maximization

    … In the first part of the work, we study revenue maximization in single-bidder multi-item settings, connecting this problem to a well-studied problem in measure theory, namely the design of optimal transport maps. By establishing strong duality between these two problems, we obtain a …

    mit Repository record for Mechanism design : from optimal transport theory to revenue maximization (opens in a new tab)

  17. Using information maximization for alignment of objects with albedos

    Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.

    mit Repository record for Using information maximization for alignment of objects with albedos (opens in a new tab)

  18. Influence maximization over a network : static and dynamic policies

    The problem of maximizing the spread of an opinion inside a social network has been investigated extensively during the past decade. The importance of this problem in applications such as marketing has been amplified by the major expansion of online social networks. In this thesis, we study opinion …

    mit Repository record for Influence maximization over a network : static and dynamic policies (opens in a new tab)

  19. Efficient buffer design algorithms for production line profit maximization

    … makes contributions to production system profit maximization. The profit of a production line is the revenue associated with the production rate minus the buffer space cost and average inventory holding cost. We assume that machines have already been chosen and therefore our only decision …

    mit Repository record for Efficient buffer design algorithms for production line profit maximization (opens in a new tab)

Page 1 of 37