Log in

Relevant bibliographies by topics / VARIABLE ORDERING / Dissertations / Theses

To see the other types of publications on this topic, follow the link: VARIABLE ORDERING.

Dissertations / Theses on the topic 'VARIABLE ORDERING'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 15 dissertations / theses for your research on the topic 'VARIABLE ORDERING.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Angeles, Martinez Rene. "Coulomb gluons and the ordering variable." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/coulomb-gluons-and-the-ordering-variable(c9d90246-4afa-4647-aece-bdd9605b7692).html.

Full text

Abstract:

In this thesis, we study the soft gluon corrections to hard wide-angle scattering processes due to a virtual gluon exchange (one-loop order) and the emission of up to two gluons. Our primary aim is to determine the ordering condition that should be used to dress a hard scattering process with corrections due to gluon emissions and a Coulomb (Glauber) gluon exchange. We find that, due to an elegant cancellation of many Feynman diagrams, a specific ordering variable should be used to order the transverse momentum of the exchanged Coulomb gluon with respect to the real emissions. Furthermore, in

APA, Harvard, Vancouver, ISO, and other styles

2

Bartlett, Lisa Marie. "Variable ordering heuristics for binary decision diagrams." Thesis, Loughborough University, 2000. https://dspace.lboro.ac.uk/2134/10362.

Full text

Abstract:

Fault tree analysis, FTA, is one of the most commonly used techniques for safety system assessment. Over the past five years the Binary Decision Diagram (BDD) methodology has been introduced which significantly aids the analysis of the fault tree diagram. The approach has been shown to improve both the efficiency of determining the minimal cut sets of the fault tree, and also the accuracy of the calculation procedure used to quantifY the top event parameters. To utilise the BDD technique the fault tree structure needs to be converted into the BDD format. Converting the fault tree is relatively

APA, Harvard, Vancouver, ISO, and other styles

3

Kwan, Alvin Chi Ming. "A framework for mapping constraint satisfaction problems to solution methods." Thesis, University of Essex, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339436.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Soleimani, Behnam [Verfasser], Christiane [Akademischer Betreuer] Tammer, and Akhtar [Akademischer Betreuer] Khan. "Vector optimization problems with variable ordering structures / Behnam Soleimani. Betreuer: Christiane Tammer ; Akhtar Khan." Halle, Saale : Universitäts- und Landesbibliothek Sachsen-Anhalt, 2015. http://d-nb.info/1069814768/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Natarajan, Ramkumar. "Efficient Factor Graph Fusion for Multi-robot Mapping." Digital WPI, 2017. https://digitalcommons.wpi.edu/etd-theses/1201.

Full text

Abstract:

"This work presents a novel method to efficiently factorize the combination of multiple factor graphs having common variables of estimation. The fast-paced innovation in the algebraic graph theory has enabled new tools of state estimation like factor graphs. Recent factor graph formulation for Simultaneous Localization and Mapping (SLAM) like Incremental Smoothing and Mapping using the Bayes tree (ISAM2) has been very successful and garnered much attention. Variable ordering, a well-known technique in linear algebra is employed for solving the factor graph. Our primary contribution in this wor

APA, Harvard, Vancouver, ISO, and other styles

6

Park, Vincent Se-jin. "AN EMPIRICAL STUDY OF DIFFERENT BRANCHING STRATEGIES FOR CONSTRAINT SATISFACTION PROBLEMS." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1193.

Full text

Abstract:

Many real life problems can be formulated as constraint satisfaction problems <i>(CSPs)</i>. Backtracking search algorithms are usually employed to solve <i>CSPs</i> and in backtracking search the choice of branching strategies can be critical since they specify how a search algorithm can instantiate a variable and how a problem can be reduced into subproblems; that is, they define a search tree. In spite of the apparent importance of the branching strategy, there have been only a few empirical studies about different branching strategies and they all have been tested exclusively for nume

APA, Harvard, Vancouver, ISO, and other styles

7

Lipfert, Tobias. "Ordering effects in quantum optics." Thesis, Lille 1, 2019. http://www.theses.fr/2019LIL1R007/document.

Full text

Abstract:

En optique quantique, la nature quantique de la lumière se manifeste dans des effets d’ordonnement d’opérateurs, inexistants en optique classique. Cette thèse est consacrée à une étude détaillée de ce type d’effets d’ordonnement dus à la dynamique des systèmes physiques. Nous considérons deux systèmes en particulier, 1) la conversion paramétrique descendante dans un milieu χ (2), et 2) un ion dans un piège de Paul entraı̂né par un champ classique; décrit par un modèle de Jaynes-Cummings non linéaire. Les effets d’ordonnement dans ces systèmes dynamiques sont étudiés via le développement et l’a

APA, Harvard, Vancouver, ISO, and other styles

8

Lipfert, Tobias. "Ordering effects in quantum optics." Electronic Thesis or Diss., Université de Lille (2018-2021), 2019. http://www.theses.fr/2019LILUR007.

Full text

Abstract:

En optique quantique, la nature quantique de la lumière se manifeste dans des effets d’ordonnement d’opérateurs, inexistants en optique classique. Cette thèse est consacrée à une étude détaillée de ce type d’effets d’ordonnement dus à la dynamique des systèmes physiques. Nous considérons deux systèmes en particulier, 1) la conversion paramétrique descendante dans un milieu χ (2), et 2) un ion dans un piège de Paul entraı̂né par un champ classique; décrit par un modèle de Jaynes-Cummings non linéaire. Les effets d’ordonnement dans ces systèmes dynamiques sont étudiés via le développement et l’a

APA, Harvard, Vancouver, ISO, and other styles

9

張世龍. "Variable Ordering Optimization for OBDD." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/37036053904783361877.

Full text

Abstract:

碩士<br>大葉大學<br>資訊工程學系碩士班<br>92<br>OBDD (Ordered binary decision diagrams) is the most popular data structure for Boolean function representation in modern logic synthesis/verification EDA tools. It is obvious that the variable ordering is the key factor for reducing the size (nodes) of an OBDD. Therefore, how to find an effective variable order is the most critical issue during OBDD construction. Observing the constructed OBDD of a given variable order, we find that the number of nodes of the OBDD is proportional to the number of branches of the OBDD. Based on this observation, we propose an al

APA, Harvard, Vancouver, ISO, and other styles

10

Yen, Hsiu-Feng, and 顏秀鳳. "Optimal ordering policy for inventory system involving variable lead time and time value of money." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/25403800135379225511.

Full text

Abstract:

碩士<br>淡江大學<br>管理科學學系<br>90<br>This thesis proposes the stochastic inventory mathematical model for the continuous review inventory systems under simultaneously taking account to the controllable lead time and time value of money. In the model, the shortages are allowed and the total amount of stockout during the stockout period is considered to be a mixture of backorders and lost sales. In addition, the common decision variables are the order quantity, reorder point and lead time. In this proposal, we first consider the case where the demand of lead time follows a normal distribution, and then

APA, Harvard, Vancouver, ISO, and other styles

11

Yaung, Sian-Siang, and 楊相賢. "A Study On Optimal Ordering Policy for Perishable Commodity under Probabilistic Demand Multi-market and Multi-decision-variable." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/15863487020032377181.

Full text

Abstract:

碩士<br>國立屏東科技大學<br>工業管理系<br>93<br>This study constructs a mathematical model concerned to issues of multi-market and varied demands with differentiated market prices on perishable commodity problems. While optimizing lot-sizing and pricing Pi as a function of Tπ(Q,P1,P2,P3), the proposed model designs a four stage for market prices with expiration dates to explore the total profits and analyze the effect of price elasticity on demand variations expectedly. Not only compare the perishables commodity with multi-market making price to find out the expected total profit within expiry date, but al

APA, Harvard, Vancouver, ISO, and other styles

12

Štola, Miroslav. "Kombinace evolučních algoritmů a programování s omezujícími podmínkami pro rozvrhování." Master's thesis, 2016. http://www.nusl.cz/ntk/nusl-346749.

Full text

Abstract:

Scheduling problems and constraint satisfaction problems are generally known to be extremely hard. This thesis proposes a new evolutionary al- gorithm approach to solve a constrained-based scheduling problem. In this approach, variable orderings are evolved. The variable ordering serves as a parameter for the constraint solver. Its purpose is to determine the order in which variables are labelled by the solver. Hence the evolving individuals may be encoded as permutations. Therefore, our approach can be applied to a wider range of constraint satisfaction problems. Methods for generating the in

APA, Harvard, Vancouver, ISO, and other styles

13

Chen, Yang, and 陳揚. "Variable ordering of binary decision diagram for product term reduction and its application to area minimization on single electron transistor arrays." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/66152350208205434539.

Full text

Abstract:

碩士<br>國立交通大學<br>電子工程學系電子研究所<br>103<br>As fabrication process exploits even deeper submicron technology, power dissipation has become a crucial issue for electronic circuit and system design nowadays. In particular, leakage power is becoming a dominant source of power consumption. In recent years, the reconfigurable single-electron transistor (SET) array has been considered as the promising device for continuing Moore’s Law due to its ultra-low power consumption. Several automated mapping approaches have been developed for the reconfigurable SET array. However, all of these approaches only con

APA, Harvard, Vancouver, ISO, and other styles

14

Santos, Beatriz Ferreira. "A study on s-IFR and s-IFRA orderings and an application to parallel systems." Master's thesis, 2019. http://hdl.handle.net/10316/88006.

Full text

Abstract:

Dissertação de Mestrado em Matemática apresentada à Faculdade de Ciências e Tecnologia<br>Muitas classes de distribuições que representam o tempo de vida de um sistema são caracterizadas pelas suas propriedades de envelhecimento. Estas propriedades podem ser descritas através da função de sobrevivência ou da função de taxa de falha e permitem-nos ainda estabelecer comparações entre distribuições dentro da mesma família, dando origem às ordenações de envelhecimento. No caso de duas variáveis aleatórias que representem o tempo de vida de dois sistemas diferentes, é muitas vezes útil saber qual

APA, Harvard, Vancouver, ISO, and other styles

15

Huguet, Guillaume. "Étude d’algorithmes de simulation par chaînes de Markov non réversibles." Thesis, 2020. http://hdl.handle.net/1866/24345.

Full text

Abstract:

Les méthodes de Monte Carlo par chaînes de Markov (MCMC) utilisent généralement des chaînes de Markov réversibles. Jusqu’à récemment, une grande partie de la recherche théorique sur les chaînes de Markov concernait ce type de chaînes, notamment les théorèmes de Peskun (1973) et de Tierney (1998) qui permettent d’ordonner les variances asymptotiques de deux estimateurs issus de chaînes réversibles différentes. Dans ce mémoire nous analysons des algorithmes simulants des chaînes qui ne respectent pas cette condition. Nous parlons alors de chaînes non réversibles. Expérimentalement, ces ch

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!