Log in

Relevant bibliographies by topics / VARIABLE ORDERING / Journal articles

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

Journal articles 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 50 journal articles 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 journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Ortiz-Bayliss, José Carlos, Ivan Amaya, Santiago Enrique Conant-Pablos, and Hugo Terashima-Marín. "Exploring the Impact of Early Decisions in Variable Ordering for Constraint Satisfaction Problems." Computational Intelligence and Neuroscience 2018 (2018): 1–14. http://dx.doi.org/10.1155/2018/6103726.

Full text

Abstract:

When solving constraint satisfaction problems (CSPs), it is a common practice to rely on heuristics to decide which variable should be instantiated at each stage of the search. But, this ordering influences the search cost. Even so, and to the best of our knowledge, no earlier work has dealt with how first variable orderings affect the overall cost. In this paper, we explore the cost of finding high-quality orderings of variables within constraint satisfaction problems. We also study differences among the orderings produced by some commonly used heuristics and the way bad first decisions affec

APA, Harvard, Vancouver, ISO, and other styles

2

Kissmann, P., and J. Hoffmann. "BDD Ordering Heuristics for Classical Planning." Journal of Artificial Intelligence Research 51 (December 30, 2014): 779–804. http://dx.doi.org/10.1613/jair.4586.

Full text

Abstract:

Symbolic search using binary decision diagrams (BDDs) can often save large amounts of memory due to its concise representation of state sets. A decisive factor for this method's success is the chosen variable ordering. Generally speaking, it is plausible that dependent variables should be brought close together in order to reduce BDD sizes. In planning, variable dependencies are typically captured by means of causal graphs, and in preceding work these were taken as the basis for finding BDD variable orderings. Starting from the observation that the two concepts of "dependency" are actually qui

APA, Harvard, Vancouver, ISO, and other styles

3

Grüttemeier, Niels, Christian Komusiewicz, and Nils Morawietz. "Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 14 (2021): 12328–35. http://dx.doi.org/10.1609/aaai.v35i14.17463.

Full text

Abstract:

In Bayesian Network Structure Learning (BNSL), we are given a variable set and parent scores for each variable and aim to compute a DAG, called Bayesian network, that maximizes the sum of parent scores, possibly under some structural constraints. Even very restricted special cases of BNSL are computationally hard, and, thus, in practice heuristics such as local search are used. In a typical local search algorithm, we are given some BNSL solution and ask whether there is a better solution within some pre-defined neighborhood of the solution. We study ordering-based local search, where a solutio

APA, Harvard, Vancouver, ISO, and other styles

4

Singh, Harshinder, and Kanchan Jain. "Preservation of some partial orderings under Poisson shock models." Advances in Applied Probability 21, no. 3 (1989): 713–16. http://dx.doi.org/10.2307/1427647.

Full text

Abstract:

Suppose each of the two devices is subjected to shocks occurring randomly as events in a Poisson process with constant intensity λ. Let Pk denote the probability that the first device will survive the first k shocks and let denote such a probability for the second device. Let and denote the survival functions of the first and the second device respectively. In this note we show that some partial orderings, namely likelihood ratio ordering, failure rate ordering, stochastic ordering, variable ordering and mean residual-life ordering between the shock survival probabilities and are preserved by

APA, Harvard, Vancouver, ISO, and other styles

5

Singh, Harshinder, and Kanchan Jain. "Preservation of some partial orderings under Poisson shock models." Advances in Applied Probability 21, no. 03 (1989): 713–16. http://dx.doi.org/10.1017/s0001867800018929.

Full text

Abstract:

Suppose each of the two devices is subjected to shocks occurring randomly as events in a Poisson process with constant intensity λ. Let Pk denote the probability that the first device will survive the first k shocks and let denote such a probability for the second device. Let and denote the survival functions of the first and the second device respectively. In this note we show that some partial orderings, namely likelihood ratio ordering, failure rate ordering, stochastic ordering, variable ordering and mean residual-life ordering between the shock survival probabilities and are preserved by

APA, Harvard, Vancouver, ISO, and other styles

6

Chang, Cheng-Shang. "A new ordering for stochastic majorization: theory and applications." Advances in Applied Probability 24, no. 3 (1992): 604–34. http://dx.doi.org/10.2307/1427482.

Full text

Abstract:

In this paper, we develop a unified approach for stochastic load balancing on various multiserver systems. We expand the four partial orderings defined in Marshall and Olkin, by defining a new ordering based on the set of functions that are symmetric, L-subadditive and convex in each variable. This new partial ordering is shown to be equivalent to the previous four orderings for comparing deterministic vectors but differs for random vectors. Sample-path criteria and a probability enumeration method for the new stochastic ordering are established and the ordering is applied to various fork-join

APA, Harvard, Vancouver, ISO, and other styles

7

Chang, Cheng-Shang. "A new ordering for stochastic majorization: theory and applications." Advances in Applied Probability 24, no. 03 (1992): 604–34. http://dx.doi.org/10.1017/s0001867800024435.

Full text

Abstract:

In this paper, we develop a unified approach for stochastic load balancing on various multiserver systems. We expand the four partial orderings defined in Marshall and Olkin, by defining a new ordering based on the set of functions that are symmetric, L-subadditive and convex in each variable. This new partial ordering is shown to be equivalent to the previous four orderings for comparing deterministic vectors but differs for random vectors. Sample-path criteria and a probability enumeration method for the new stochastic ordering are established and the ordering is applied to various fork-join

APA, Harvard, Vancouver, ISO, and other styles

8

Sompolska-Rzechuła, Agnieszka. "Selection of the method of linear ordering using the example of assessing the level of socio-economic development of European Union countries." Prace Naukowe Uniwersytetu Ekonomicznego we Wrocławiu 64, no. 7 (2020): 118–29. http://dx.doi.org/10.15611/pn.2020.7.09.

Full text

Abstract:

The aim of the article is to present the issues of choosing the optimal procedure for the linear ordering of objects and assessing the correctness of the selected methods of the linear ordering. The goal was achieved by creating linear ordering of objects using various methods for normalizing the value of diagnostic features. An aggregate measure based on various properties of the synthetic feature was used to select the optimal ordering, among others, the compatibility of the mapping, the correlation of the synthetic line variable with diagnostic variables, the rank correlation of the synthet

APA, Harvard, Vancouver, ISO, and other styles

9

Xu, Hong, Kexuan Sun, Sven Koenig, and T. K. Satish Kumar. "Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP." Proceedings of the International Symposium on Combinatorial Search 11, no. 1 (2021): 91–99. http://dx.doi.org/10.1609/socs.v11i1.18539.

Full text

Abstract:

The weighted constraint satisfaction problem (WCSP) is a powerful mathematical framework for combinatorial optimization. The branch and bound search paradigm is very successful in solving the WCSP but critically depends on the ordering in which variables are instantiated. In this paper, we introduce a new framework for dynamic variable ordering for solving the WCSP. This framework is inspired by regression decision tree learning. Variables are ordered dynamically based on samples of random assignments of values to variables as well as their corresponding total weights. Within this framework, w

APA, Harvard, Vancouver, ISO, and other styles

10

Kissmann, Peter, and Jörg Hoffmann. "What’s in It for My BDD? On Causal Graphs and Variable Orders in Planning." Proceedings of the International Conference on Automated Planning and Scheduling 23 (June 2, 2013): 327–31. http://dx.doi.org/10.1609/icaps.v23i1.13598.

Full text

Abstract:

One decisive factor for the success of symbolic search using BDDs is whether or not the variable ordering is good. A general intuition is that smaller BDDs result if inter-dependent variables are close together. The most common means to capture variable dependencies in planning are causal graphs, and consequently previous work defined variable orders based on these. Starting from the observation that the two concepts of “dependency” are actually quite different, we introduce a framework for assessing the strength of variable ordering heuristics in sub-classes of planning. It turns out that cau

APA, Harvard, Vancouver, ISO, and other styles

11

Martin, Ursula, and Elizabeth Scott. "The order types of termination orderings on monadic terms, strings and multisets." Journal of Symbolic Logic 62, no. 2 (1997): 624–35. http://dx.doi.org/10.2307/2275551.

Full text

Abstract:

AbstractWe consider total well-founded orderings on monadic terms satisfying the replacement and full invariance properties. We show that any such ordering on monadic terms in one variable and two unary function symbols must have order typeω,ω2orωω. We show that a familiar construction gives rise to continuum many such orderings of order typeω. We construct a new family of such orderings of order typeω2, and show that there are continuum many of these. We show that there are only four such orderings of order typeωω, the two familiar recursive path orderings and two closely related orderings. W

APA, Harvard, Vancouver, ISO, and other styles

12

Sohn, Surg-Won. "Variable Ordering Algorithms Using Problem Classifying." Journal of the Korea Society of Computer and Information 16, no. 4 (2011): 127–35. http://dx.doi.org/10.9708/jksci.2011.16.4.127.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Ángeles-Martínez, René, Jeffrey R. Forshaw, and Michael H. Seymour. "Coulomb gluons and the ordering variable." Journal of High Energy Physics 2015, no. 12 (2015): 1–28. http://dx.doi.org/10.1007/jhep12(2015)091.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Cox, James L., Stephen Lucci, and Tayfun Pay. "Effects of Dynamic Variable - Value Ordering Heuristics on the Search Space of Sudoku Modeled as a Constraint Satisfaction Problem." Inteligencia Artificial 22, no. 63 (2019): 1–15. http://dx.doi.org/10.4114/intartif.vol22iss63pp1-15.

Full text

Abstract:

We carry out a detailed analysis of the effects of different dynamic variable and value ordering heuristics on the search space of Sudoku when the encoding method and the filtering algorithm are fixed. Our study starts by examining lexicographical variable and value ordering and evaluates different combinations of dynamic variable and value ordering heuristics. We eventually build up to a dynamic variable ordering heuristic that has two rounds of tie-breakers, where the second tie-breaker is a dynamic value ordering heuristic. We show that our method that uses this interlinked heuristic outper

APA, Harvard, Vancouver, ISO, and other styles

15

Ibáñez-Llano, C., E. Meléndez, and Nieto F. "Variable ordering schemes to apply to the binary decision diagram methodology for event tree sequences assessment." Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability 222, no. 1 (2008): 7–16. http://dx.doi.org/10.1243/1748006xjrr67.

Full text

Abstract:

Binary decision diagram (BDD) methodology is the most recent approach to improve Boolean reliability models assessment. The final size of the BDD, and therefore the ultimate benefits of this technique, are very sensitive to the initial variable ordering that has to be fixed prior to conversion. Several variable ordering strategies have been proposed in the literature, all of them focused on the treatment of single fault tree models. This paper proposes some extensions of existing variable ordering schemes for the case of combinations of non-disjoint fault trees, as is the case in quantifying s

APA, Harvard, Vancouver, ISO, and other styles

16

Kask, Kalev, Andrew Gelfand, Lars Otten, and Rina Dechter. "Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (2011): 54–60. http://dx.doi.org/10.1609/aaai.v25i1.7828.

Full text

Abstract:

We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size — two parameters known to bound the complexity of inference in graphical models. We propose and implement the Iterative Greedy Variable Ordering (IGVO) algorithm, a new variant within this algorithm class. An empirical evaluation using different ranking functions and conditions of randomness, demonstrates that IGVO finds significantly better orderings than standard greedy ordering implementations when evaluated within an anytime framework. Additional order of mag

APA, Harvard, Vancouver, ISO, and other styles

17

Adam, Mohd Bakri. "Stochastic ordering constraint for ordered extremes." MATEMATIKA 33, no. 1 (2017): 21. http://dx.doi.org/10.11113/matematika.v33.n1.769.

Full text

Abstract:

The constraint of two ordered extreme minima random variables when one variable is consider to be stochastically smaller than the other one has been carried out in this article. The quantile functions of the probability distribution have been used to establish partial ordering between the two variables. Some extensions and generalizations are given for the stochastic ordering using the important of sign of the shape parameter.

APA, Harvard, Vancouver, ISO, and other styles

18

Drechsler, R., B. Becker, and N. Göckel. "Genetic algorithm for variable ordering of OBDDs." IEE Proceedings - Computers and Digital Techniques 143, no. 6 (1996): 364. http://dx.doi.org/10.1049/ip-cdt:19960789.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Yeh, Fu-Min, and Chen-Shang Lin. "OBDD variable ordering by interleaving compacted clusters." Electronics Letters 31, no. 20 (1995): 1724–25. http://dx.doi.org/10.1049/el:19951177.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Siklitskaya, Alexandra, Sergey Yastrebov, and Roger Smith. "Variable step radial ordering in carbon onions." Diamond and Related Materials 32 (February 2013): 32–35. http://dx.doi.org/10.1016/j.diamond.2012.11.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Henderson, James R., C. Ruth Le Sueur, Steven G. Pavett, and Jonathan Tennyson. "Coordinate ordering in the discrete variable representation." Computer Physics Communications 74, no. 2 (1993): 193–98. http://dx.doi.org/10.1016/0010-4655(93)90089-u.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

FUJII, KAZUYUKI, and TATSUO SUZUKI. "A NEW SYMMETRIC EXPRESSION OF WEYL ORDERING." Modern Physics Letters A 19, no. 11 (2004): 827–40. http://dx.doi.org/10.1142/s021773230401374x.

Full text

Abstract:

For the creation operator a† and the annihilation operator a of a harmonic oscillator, we consider Weyl ordering expression of (a†a)n and obtain a new symmetric expression of Weyl ordering w.r.t. a†a≡N and aa†=N+1 where N is the number operator. Moreover, we interpret intertwining formulas of various orderings in view of the difference theory. Then we find that the noncommutative parameter corresponds to the increment of the difference operator w.r.t. variable N. Therefore, quantum (noncommutative) calculations of harmonic oscillators are done by classical (commutative) ones of the number oper

APA, Harvard, Vancouver, ISO, and other styles

23

Ortega-Jiménez, Patricia, Miguel A. Sordo, and Alfonso Suárez-Llorens. "Stochastic Comparisons of Some Distances between Random Variables." Mathematics 9, no. 9 (2021): 981. http://dx.doi.org/10.3390/math9090981.

Full text

Abstract:

The aim of this paper is twofold. First, we show that the expectation of the absolute value of the difference between two copies, not necessarily independent, of a random variable is a measure of its variability in the sense of Bickel and Lehmann (1979). Moreover, if the two copies are negatively dependent through stochastic ordering, this measure is subadditive. The second purpose of this paper is to provide sufficient conditions for comparing several distances between pairs of random variables (with possibly different distribution functions) in terms of various stochastic orderings. Applicat

APA, Harvard, Vancouver, ISO, and other styles

24

Greenberg, Albert G., and Robert J. Vanderbei. "Quicker Convergence for Iterative Numerical Solutions to Stochastic Problems: Probabilistic Interpretations, Ordering Heuristics, and Parallel Processing." Probability in the Engineering and Informational Sciences 4, no. 4 (1990): 493–521. http://dx.doi.org/10.1017/s0269964800001790.

Full text

Abstract:

Gauss-Seidel is a general method for solving a system of equations (possibly nonlinear). It makes repeated sweeps through the variables; within a sweep as each new estimate for a variable is computed, the current estimate for that variable is replaced with the new estimate immediately, instead of on completion of the sweep. The idea is to use new data as soon as it is computed. Gauss- Seidel is often efficient for computing the invariant measure of a Markov chain (especially if the transition matrix is sparse), and for computing the value function in optimal control problems. In many applicati

APA, Harvard, Vancouver, ISO, and other styles

25

Cox, Nicholas J. "Speaking Stata: Ordering or ranking groups of observations." Stata Journal: Promoting communications on statistics and Stata 21, no. 3 (2021): 818–37. http://dx.doi.org/10.1177/1536867x211045582.

Full text

Abstract:

Results for categorical variables may often be clearer if those variables are reordered or reranked, say, according to some measure of absolute or relative frequency or according to summaries of some other variable. Some graphical and tabulation commands have dedicated options serving that end. Otherwise, in practice a new order is often best achieved by creating a new variable holding the desired order using one or another egen function. There is usually a need to preserve the information in existing values or value labels and to watch out for ties. There may be a desire to reverse the direct

APA, Harvard, Vancouver, ISO, and other styles

26

Cox, Nicholas J. "Speaking Stata: Ordering or ranking groups of observations." Stata Journal: Promoting communications on statistics and Stata 21, no. 3 (2021): 818–37. http://dx.doi.org/10.1177/1536867x211045582.

Full text

Abstract:

Results for categorical variables may often be clearer if those variables are reordered or reranked, say, according to some measure of absolute or relative frequency or according to summaries of some other variable. Some graphical and tabulation commands have dedicated options serving that end. Otherwise, in practice a new order is often best achieved by creating a new variable holding the desired order using one or another egen function. There is usually a need to preserve the information in existing values or value labels and to watch out for ties. There may be a desire to reverse the direct

APA, Harvard, Vancouver, ISO, and other styles

27

Li, Dong Hai, Hai Chen Wang, Zhong Lei Fan, and Xiao Jun Yang. "Formal Verification for Polynomial Datapaths Based on Weighted Generalized Lists." Advanced Materials Research 433-440 (January 2012): 6483–89. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.6483.

Full text

Abstract:

Weighted generalized list (WGL) can effectively express multi-variate polynomial. In this paper, variable ordering algorithm, variable replacement algorithm and variable mergence algorithm for WGL are presented. Based on variable replacement algorithm, variable ordering algorithm and variable merging algorithm, an algorithm of backward-construction WGL is proposed, which is used to verify the equivalence between the behaviors specification and register transfer level (RTL) implementation of polynomial datapaths. Experimental results show that the proposed method is effective.

APA, Harvard, Vancouver, ISO, and other styles

28

Bonnici, Vincenzo, and Rosalba Giugno. "On the Variable Ordering in Subgraph Isomorphism Algorithms." IEEE/ACM Transactions on Computational Biology and Bioinformatics 14, no. 1 (2017): 193–203. http://dx.doi.org/10.1109/tcbb.2016.2515595.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Long, Wangning, Yinghua Min, Shiyuan Yang, and Shibai Tong. "Short-time scaling of variable ordering of OBDDs." Journal of Computer Science and Technology 12, no. 4 (1997): 366–71. http://dx.doi.org/10.1007/bf02943155.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Huang, N. J., X. Q. Yang, and W. K. Chan. "Vector complementarity problems with a variable ordering relation." European Journal of Operational Research 176, no. 1 (2007): 15–26. http://dx.doi.org/10.1016/j.ejor.2005.06.046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

杨, 爽. "Scalarization of Optimal Element under Variable Ordering Structure." Pure Mathematics 10, no. 11 (2020): 1024–29. http://dx.doi.org/10.12677/pm.2020.1011121.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Garcia, Carlos G., Dionisio Pérez-Brito, Vicente Campos, and Rafael Martí. "Variable neighborhood search for the linear ordering problem." Computers & Operations Research 33, no. 12 (2006): 3549–65. http://dx.doi.org/10.1016/j.cor.2005.03.032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Kukuła, Karol, and Lidia Luty. "O wyborze metody porządkowania liniowego do oceny gospodarki odpadami w Polsce w ujęciu przestrzennym." Zeszyty Naukowe SGGW w Warszawie - Problemy Rolnictwa Światowego 18(33), no. 2 (2018): 183–92. http://dx.doi.org/10.22630/prs.2018.18.2.46.

Full text

Abstract:

The aim of the article is to present the technique of selection of the method of the linear ordering of objects due to the level of a complex phenomenon, which is the status of waste management in voivodeships in Poland. For this purpose there were selected diagnostic variables describing the analyzed phenomenon and linear ordering methods were selected. Then, using the selection procedure for ordering methods, it was chosen the method of construction of a synthetic variable, that allowed to build ranking of voivodeships due to the level of the analyzed phenomenon. Then the voivodeships were d

APA, Harvard, Vancouver, ISO, and other styles

34

Grumberg, O., S. Livne, and S. Markovitch. "Learning to Order BDD Variables in Verification." Journal of Artificial Intelligence Research 18 (January 1, 2003): 83–116. http://dx.doi.org/10.1613/jair.1096.

Full text

Abstract:

The size and complexity of software and hardware systems have significantly increased in the past years. As a result, it is harder to guarantee their correct behavior. One of the most successful methods for automated verification of finite-state systems is model checking. Most of the current model-checking systems use binary decision diagrams (BDDs) for the representation of the tested model and in the verification process of its properties. Generally, BDDs allow a canonical compact representation of a boolean function (given an order of its variables). The more compact the BDD is, the better

APA, Harvard, Vancouver, ISO, and other styles

35

Kukuła, Karol, and Lidia Luty. "The Proposal for the Procedure Supporting Selection of a Linear Ordering Method." Przegląd Statystyczny 62, no. 2 (2015): 219–31. http://dx.doi.org/10.5604/01.3001.0014.1748.

Full text

Abstract:

In this paper there was analyzed the issue of the selection of linear ordering method based on synthetic variable. The research of the status of waste management in Polish voivodeships in 2012 showed that selection procedures for the construction of synthetic variable affects the ranking of the objects under investigation. In the paper authors proposed a method supporting decision to select linear ordering procedure based on between ranking linear comparison measure (Kukuła, 1989). The choice of ordering methods with the use of the proposed procedure, of course, depends largely on the output o

APA, Harvard, Vancouver, ISO, and other styles

36

Ramasubramanian, S., and P. Mahendran. "Estimation of Hazard Rate and Mean Residual Life Ordering for Fuzzy Random Variable." Abstract and Applied Analysis 2015 (2015): 1–5. http://dx.doi.org/10.1155/2015/164795.

Full text

Abstract:

L2-metric is used to find the distance between triangular fuzzy numbers. The mean and variance of a fuzzy random variable are also determined by this concept. The hazard rate is estimated and its relationship with mean residual life ordering of fuzzy random variable is investigated. Additionally, we have focused on deriving bivariate characterization of hazard rate ordering which explicitly involves pairwise interchange of two fuzzy random variablesXandY.

APA, Harvard, Vancouver, ISO, and other styles

37

Monika Silvia Gultom and Mariana Simanjuntak. "Persepsi dan Perilaku Pengguna dalam Menggunakan Aplikasi Mobile Gojek untuk Pemesanan Makanan Secara Online: Persepsi Kemudahan Penggunaan, Persepsi Kegunaan, Pengalaman Pengguna dan Kepuasan Pengguna." Journal of Creative Student Research 2, no. 4 (2024): 96–102. http://dx.doi.org/10.55606/jcsr-politama.v2i4.3986.

Full text

Abstract:

Mobile applications have become an integral part of everyday life. One example is Gojek, which is popular in Indonesia with a variety of services including online food ordering. Ordering food through this application offers comfort and convenience for users. To gain a deeper understanding of user responses and behavior in using this application, comprehensive research is needed. The method used in this research uses a quantitative approach. The results of this research are that User Satisfaction (KP) has an R-Square value of 0.699 and an Adjusted R-Square value of 0.666. Then the User Experien

APA, Harvard, Vancouver, ISO, and other styles

38

Aloul, Fadi, Igor Markov, and Karem Sakallah. "MINCE: A Static Global Variable-Ordering Heuristic for SAT Search and BDD Manipulation." JUCS - Journal of Universal Computer Science 10, no. (12) (2004): 1562–96. https://doi.org/10.3217/jucs-010-12-1562.

Full text

Abstract:

The increasing popularity of SAT and BDD techniques in formal hardware verification and automated synthesis of logic circuits encourages the search for additional speedups. Since typical SAT and BDD algorithms are exponential in the worst-case, the structure of realworld instances is a natural source of improvements. While SAT and BDD techniques are often presented as mutually exclusive alternatives, our work points out that both can be improved via the use of the same structural properties of instances. Our proposed methods are based on efficient problem partitioning and can be easily applied

APA, Harvard, Vancouver, ISO, and other styles

39

Korzeniewski, Jerzy, and Patrycja Melon. "The Development of Islamic Banking in the UK – A Comparison of Islamic and Conventional Banking." Ekonomia Międzynarodowa, no. 43 (September 30, 2023): 22–40. http://dx.doi.org/10.18778/2082-4440.43.02.

Full text

Abstract:

The purpose of the article is to compare the development of several Islamic banks and conventional banks operating in the UK in 2014–2021. A statistical method of linear ordering of objects characterized by several variables, which is simple in interpretation, was used. The main difficulty was to take into account the time-varying quotation of the values of the considered variables. A novel method was proposed to take into account both the value of several variable and their variability over time. In this method, the emphasis can be placed on the final reslut, that is, consider only the values

APA, Harvard, Vancouver, ISO, and other styles

40

Permasih, Desta, Arif Imam Suroso, and Nur Hasanah. "Intention to Use and Over-Ordering in Online Food Delivery Services: An Extension of the Theory of Planned Behavior." Journal of Consumer Sciences 9, no. 3 (2024): 315–37. http://dx.doi.org/10.29244/jcs.9.3.315-337.

Full text

Abstract:

Online food delivery (OFD) services can shape consumer habits through regular use. Although promotions attract consumers, they may also encourage food waste. This study analyzes factors influencing the intention to use OFD services and over-ordering behaviors by extending the Theory of Planned Behavior (TPB) with variables such as sales promotion and leftover reuse. The study used purposive sampling and collected data from an online survey of 253 OFD service users in Jabodetabek. Descriptive analysis and Partial Least Squares-Structural Equation Modeling (PLS-SEM) were applied. Results showed

APA, Harvard, Vancouver, ISO, and other styles

41

Pipatsrisawat, Thammanit, and Adnan Darwiche. "A Lower Bound on the Size of Decomposable Negation Normal Form." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (2010): 345–50. http://dx.doi.org/10.1609/aaai.v24i1.7600.

Full text

Abstract:

We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowledge bases was introduced recently and shown to include OBDD as a special case (an OBDD variable ordering is a special type of vtree). We provide a lower bound on the size of any structured DNNF and discuss three particular instances of this bound, which correspond to three distinct subsets of structured DNNF (including OBDD). We show that our lower bound subsumes the influential Sieling and Wegener’s lower bound for

APA, Harvard, Vancouver, ISO, and other styles

42

Song, Wen, Zhiguang Cao, Jie Zhang, Chi Xu, and Andrew Lim. "Learning variable ordering heuristics for solving Constraint Satisfaction Problems." Engineering Applications of Artificial Intelligence 109 (March 2022): 104603. http://dx.doi.org/10.1016/j.engappai.2021.104603.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Prasad, P. W. C., M. Raseen, A. Assi, and S. M. N. A. Senanayake. "BDD Path Length Minimization Based on Initial Variable Ordering." Journal of Computer Science 1, no. 4 (2005): 521–29. http://dx.doi.org/10.3844/jcssp.2005.521.529.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Eichfelder, Gabriele, and Tobias Gerlach. "Characterization of properly optimal elements with variable ordering structures." Optimization 65, no. 3 (2015): 571–88. http://dx.doi.org/10.1080/02331934.2015.1040793.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Li, X. B., Z. Lin, and Z. Y. Peng. "Convergence for vector optimization problems with variable ordering structure." Optimization 65, no. 8 (2016): 1615–27. http://dx.doi.org/10.1080/02331934.2016.1157879.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Dubrova, E. V., D. M. Miller, and J. C. Muzio. "Best ROBDD variable ordering for functions with disjunctive decompositions." Electronics Letters 33, no. 14 (1997): 1198. http://dx.doi.org/10.1049/el:19970826.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Friedman, S. J., and K. J. Supowit. "Finding the optimal variable ordering for binary decision diagrams." IEEE Transactions on Computers 39, no. 5 (1990): 710–13. http://dx.doi.org/10.1109/12.53586.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Bollig, B., and I. Wegener. "Improving the variable ordering of OBDDs is NP-complete." IEEE Transactions on Computers 45, no. 9 (1996): 993–1002. http://dx.doi.org/10.1109/12.537122.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Drechsler, R., B. Becker, and A. Jahnke. "On variable ordering and decomposition type choice in OKFDDs." IEEE Transactions on Computers 47, no. 12 (1998): 1398–403. http://dx.doi.org/10.1109/12.737685.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Durea, Marius, Radu Strugariu, and Christiane Tammer. "On set-valued optimization problems with variable ordering structure." Journal of Global Optimization 61, no. 4 (2014): 745–67. http://dx.doi.org/10.1007/s10898-014-0207-x.

Full text

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!