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 86 for “"Product-form"”.
-
Three Essays on Product Form Choice
… have three principal options for transforming their innovations into viable business models and deriving value from their innovations. They may: market intellectual know-how (via licensing and/or proof-of-concept), market intermediate products (i.e., sell components/sub-systems), or …
-
Stochastic Petri nets with product form equilibrium distributions.
Networks of queues with product-form equilibrium distributions are well established and have applications in a wide range of fields. With few exceptions these networks provide the only efficient means of analysis in large systems. The advantage that the product-form distribution provides is the …
-
Signalling in product form queueing networks / Bruce S. Northcote.
Bibliography: leaves 119-125.
-
Decomposing non-product form queuing lattices through simulated annealing
… to decompose the state transition lattice of Non-Product Form Queuing Models. Simulated Annealing Algorithm has been successfully applied to a number of optimization problem such as The Traveling Salesman Problem, Graph Partionning, Physical Computer Design, VLSI Chip Design, Image Processing,... …
-
Decomposing non-product form queuing lattices through genetic algorithm
… the state transition lattice of a class of non-product form queueing models. Genetic Algorithms are search algorithms based upon the mechanics of natural genetics. They combine a survival-of-the-fittest among string structures with a structured, yet randomized, information exchange to form a …
-
Decomposing non-product form queueing lattices through autorouting with A* algorithm
… the state transition lattice of a class of non-product form queuing modes. In this thesis, Autorouting with A* algorithm is adapted to decompose it as solvable subsets which can be solved sequentially and independently. Autorouting with A* algorithm is heuristics in problem solving. It also is …
-
Probabilistic policies in re-entrant queueing systems with a product-form steady-state distribution
… new scheduling policies based on real-time information and probabilistic controls for re-entrant (non-acyclic) Markovian queueing systems. One interpretation of the results contained in this dissertation is that they provide a generalization of the results for Jackson networks to re-entrant …
-
Παράλληλος προγραμματισμός αλγόριθμων για προβλήματα γραμμικού προγραμματισμού
… We implement an algorithm which converts MPS format to LP format and we convert a subset of benchmark problems from NETLIB. We present an analysis of two well-known updating schemes for basis inverse: (i) The Product Form of the Inverse ( PFI ) and (ii) A Modification of the Product Form …
-
The Anatomy Of Market Creation: Insights From The Base Of The Pyramid
… of creating a new market for an altogether new product form. The research was conducted over a four-year period while working as a project manager and consultant to two "greenfield" corporate ventures whose goal was to profitably serve the unmet needs of impoverished slum and village communities …
-
Timeshare: Intervals vs. points
… a company would choose to convert their current product form.
-
Applying decomposition and aggregation theory to the analysis of stochastic Petri nets and queueing networks.
… Nets, and a class of queuing networks, called product form queueing networks are investigated. The parametric analysis of Stochastic Petri Nets in general is also studied. The major analysis tool used in this thesis is the Simon and Ando's Decomposition and Aggregation theory. Local Balance …
-
The unity of form and function: making sense of product design from a consumer's point of view
… demonstrates that the perceived unity of product form and function has a significant effect on consumers’ product evaluations, where unity refers to the perception that the form and function share common associations, or meanings. Findings from three experiments suggest that beyond the …
-
A decomposition algorithm for the state transition lattices of certain non-product queueing protocols
… the state transition lattice of a class of non-product form queueing models. Here only the lattices of regular type A structure are considered. By applying the algorithm, the lattice is decomposed into solvable subsets which can be solved sequentially.</p>
-
A Disaggregated Analysis of Beef Import Demand in Japan
… was the world’s third-largest importer of beef products (USDA, 2021). Although the Japanese beef market has been studied, research on the importance of product characteristics in determining import demand has been limited. The goal of this research is to provide a detailed analysis of how U.S. …
-
WWTA load-balancing for parallel-server systems with heterogeneous servers and multi-scale heavy traffic limits for generalized Jackson networks
… part of the thesis concerns the steady-state performance approximation of WWTA policy in heavy traffic. Instead of proving a stochastic process limit followed by a limit interchange -- a method that dominates the literature, our method works directly with pre-limit BAR that characterizes the …
-
XSnap : a queueing network analysis package
… package called XSnap, which can be used to solve product-form mixed multi-class queueing networks. A Graphical User Interface allows interactive network specification, whilst the modeller can also define complex network experiments and request customised output through the use of a language called …
-
Optimization on products of combinatorial structures
… problems on combinatorial structures with a product form. The independence number of a graph G, denoted $\alpha (G)$, is the size of the largest independent set in G, where a subset S of the vertex set V(G) is independent if no two vertices in S are adjacent in G. The clique covering number …
-
General queueing networks with priorities. Maximum entropy analysis of general queueing network models with priority preemptive resume or head-of-line and non-priority based service disciplines.
… schedulling is not compatible with exact product form solutions of queueing network models (QNM's). It is therefore, necessary to employ credible approximate techniques for solving QNM's with priority classes. The principle of maximum entropy (ME) is a method of inference for estimating a …
Page 1 of 5