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 174 for “"placement problem"”.

  1. Large-scale optimization for data placement problem

    Large-scale optimization of combinatorial problems is one of the most challenging areas. These problems are characterized by large sets of data (variables and constraints). In this thesis, we study large-scale optimization of the data placement problem with zero storage cost. The goal in the data …

    lethbridge Repository record for Large-scale optimization for data placement problem (opens in a new tab)

  2. Infinite-dimensional Kalman Filtering and Sensor Placement Problem

    One of the central problems in engineering is to estimate the state of a stochastic dynamic system from limited noisy measurements. A Kalman filter is commonly used for state estimation, which produces an unbiased optimal estimate that minimizes the variance of the estimation error. Many physical …

    waterloo Repository record for Infinite-dimensional Kalman Filtering and Sensor Placement Problem (opens in a new tab)

  3. High performance algorithms for large scale placement problem

    <p>Placement is one of the most important problems in electronic design automation (EDA). An inferior placement solution will not only affect the chip’s performance but might also make it nonmanufacturable by producing excessive wirelength, which is beyond available routing resources. Although …

    iastate Repository record for High performance algorithms for large scale placement problem (opens in a new tab)

  4. Hephaestus: Solving the Heterogeneous, Highly Constrained Analog Placement Problem

    … was to investigate alternative methods for placement of highly constrained, heterogeneous architectures. Because of certain constraints on these architectures, traditional methods for placement cannot be applied directly. This thesis discusses those traditional methods that were considered …

    washington Repository record for Hephaestus: Solving the Heterogeneous, Highly Constrained Analog Placement Problem (opens in a new tab)

  5. ON RELAY NODE PLACEMENT PROBLEM FOR SURVIVABLE WIRELESS SENSOR NETWORKS

    … and health monitoring. One of the current problems with wireless sensor networks is the ability to overcome communication failures due to hardware failure, distributing sensors in an uneven geographic area, or unexpected obstacles between sensors. One common solution to overcome this …

    vcu Repository record for ON RELAY NODE PLACEMENT PROBLEM FOR SURVIVABLE WIRELESS SENSOR NETWORKS (opens in a new tab)

  6. Exact and Heuristic Algorithms for Solving the Generalized Minimum Filter Placement Problem

    We consider a problem of placing route-based filters in a communication network to limit the number of forged address attacks to a prescribed level. Nodes in the network communicate by exchanging packets along arcs, and the originating node embeds the origin and destination addresses within each …

    arizona-thes Repository record for Exact and Heuristic Algorithms for Solving the Generalized Minimum Filter Placement Problem (opens in a new tab)

  7. A Dual-Variable, 3-Dimensional Search Algorithm for the Component Placement Problem

    Made available in DSpace on 2014-12-10T22:48:14Z (GMT). No. of bitstreams: 1 7212207.pdf: 3037200 bytes, checksum: a4b638d7423e04a624d1d0d5fe3790ce (MD5) Previous issue date: 1971

    uiuc Repository record for A Dual-Variable, 3-Dimensional Search Algorithm for the Component Placement Problem (opens in a new tab)

  8. Exploring various set covering problem techniques to tackle the optimal camera placement problem

    Optimal Camera Placement (OCP) problem is a combinatorial optimization problem, where the aim is to find an optimal placement of cameras, given that a target area is completely covered. A single-objective OCP is commonly formulated in two possible ways. The first one is to maximize the area …

    lancaster Download PDF for Exploring various set covering problem techniques to tackle the optimal camera placement problem (opens in a new tab)

  9. Layout optimization with dummy features for chemical-mechanical polishing manufacturability

    … using the CAD framework to solve a real-world problem with hybrid tiling is given. Layout optimization with dummy features for specific areas of VLSI manufacturing using CMP is then discussed in detail. Based on recent semi-physical models of post-CMP topography and polish pad bending, the …

    texas Repository record for Layout optimization with dummy features for chemical-mechanical polishing manufacturability (opens in a new tab)

  10. Single video performance analysis for video-on-demand systems

    We study the content placement problem for cache delivery video-on-demand systems under static random network topologies with fixed heavy-tailed video demand. The performance measure is the amount of server load; we wish to minimize the total download rate for all users from the server and maximize …

    uiuc Repository record for Single video performance analysis for video-on-demand systems (opens in a new tab)

  11. Application and ontology in mathematics: a defence of fictionalism

    … fictionalism as a response to the mathematical placement problem. As we will see, against the backdrop of philosophical naturalism, it is difficult to see how to fit mathematical objects into our best total scientific theory. On the other hand, the indispensability argument seems to suggest that …

    whiterose Download PDF for Application and ontology in mathematics: a defence of fictionalism (opens in a new tab)

  12. H2-Optimal Sensor Location

    Optimal sensor placement is an important problem with many applications; placing thermostats in rooms, installing pressure sensors in chemical columns or attaching vibration detection devices to structures are just a few of the examples. Frequently, this placement problem is encountered while noise …

    waterloo Repository record for H2-Optimal Sensor Location (opens in a new tab)

  13. Exploring model parallelism in distributed scheduling of neural network frameworks

    … backed by partitioning of Neural Networks and placement of operators on devices in a distributed system, provides a better distributed solution to this problem. In this thesis, we motivate the case for device placement in Neural Networks. We propose, analyze and evaluate mSCT, a polynomial time …

    uiuc Repository record for Exploring model parallelism in distributed scheduling of neural network frameworks (opens in a new tab)

Page 1 of 9