Log in

Relevant bibliographies by topics / Lexicographical ordering / Journal articles

To see the other types of publications on this topic, follow the link: Lexicographical ordering.

Journal articles on the topic 'Lexicographical ordering'

Author: Grafiati

Published: 6 September 2023

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 'Lexicographical 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

Tung, Cheng-Tan. "Note on lexicographical ordering." International journal of Emerging Trends in Science and Technology 04, no. 05 (2017): 5165–70. http://dx.doi.org/10.18535/ijetst/v4i5.06.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Eghbali, Sepehr, and Ladan Tahvildari. "Test Case Prioritization Using Lexicographical Ordering." IEEE Transactions on Software Engineering 42, no. 12 (2016): 1178–95. http://dx.doi.org/10.1109/tse.2016.2550441.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Aptoula, E., and S. Lefèvre. "On lexicographical ordering in multivariate mathematical morphology." Pattern Recognition Letters 29, no. 2 (2008): 109–18. http://dx.doi.org/10.1016/j.patrec.2007.09.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lescanne, Pierre. "On the recursive decomposition ordering with lexicographical status and other related orderings." Journal of Automated Reasoning 6, no. 1 (1990): 39–49. http://dx.doi.org/10.1007/bf00302640.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Er, M. C. "Lexicographical Ordering of k-Subsets of a Set." Journal of Information and Optimization Sciences 7, no. 2 (1986): 113–16. http://dx.doi.org/10.1080/02522667.1986.10698845.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

7

MOU, Chen-qi. "Design of termination criterion of BMS algorithm for lexicographical ordering." Journal of Computer Applications 32, no. 11 (2013): 2977–80. http://dx.doi.org/10.3724/sp.j.1087.2012.02977.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wu, Yaping, and Huiqing Liu. "Lexicographical ordering by spectral moments of trees with a prescribed diameter." Linear Algebra and its Applications 433, no. 11-12 (2010): 1707–13. http://dx.doi.org/10.1016/j.laa.2010.06.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Fuertes-Olivera, Pedro A. "Specialised Lexicography for Learners: Specific Proposals for the Construction of Pedagogically-oriented Printed Business Dictionaries." HERMES - Journal of Language and Communication in Business 22, no. 42 (2017): 167. http://dx.doi.org/10.7146/hjlcb.v22i42.96851.

Full text

Abstract:

The function theory of lexicography argues that specialised lexicographical products must help learners to transform their information needs into aspects of knowledge of the discipline, and of its discursive properties. Lexicographers, then, must combine information and data access with the user’s need for information and knowledge. To achieve this aim they need to devise theories providing solutions to different lexicographical problems. One such theory has recently been proposed by Tarp (2008), who claims that there are four categories which are central to a general theory of learner’s lexic

APA, Harvard, Vancouver, ISO, and other styles

10

Farhadinia, B. "Hesitant fuzzy set lexicographical ordering and its application to multi-attribute decision making." Information Sciences 327 (January 2016): 233–45. http://dx.doi.org/10.1016/j.ins.2015.07.057.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Vazquez Noguera, Jose Luis, Christian E. Schaerer, Jacques Facon, and Horacio Legal Ayala. "Adaptive RGB Color Lexicographical Ordering Framework Using Statistical Parameters From the Color Component Histogram." IEEE Access 7 (2019): 141738–53. http://dx.doi.org/10.1109/access.2019.2943840.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Cheng, Bo, and Bolian Liu. "Lexicographical ordering by spectral moments of trees with k pendant vertices and integer partitions." Applied Mathematics Letters 25, no. 5 (2012): 858–61. http://dx.doi.org/10.1016/j.aml.2011.10.032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Daciuk, Jan, Stoyan Mihov, Bruce W. Watson, and Richard E. Watson. "Incremental Construction of Minimal Acyclic Finite-State Automata." Computational Linguistics 26, no. 1 (2000): 3–16. http://dx.doi.org/10.1162/089120100561601.

Full text

Abstract:

In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly. We present a general algorithm as well as a specialization that relies upon the lexicographical ordering of the input strings. Our method is fast and significantly lowers memory requirements in comparison to ot

APA, Harvard, Vancouver, ISO, and other styles

14

Fatichah, Chastine, Martin Leonard Tangel, Muhammad Rahmat Widyanto, Fangyan Dong, and Kaoru Hirota. "Interest-Based Ordering for Fuzzy Morphology on White Blood Cell Image Segmentation." Journal of Advanced Computational Intelligence and Intelligent Informatics 16, no. 1 (2012): 76–86. http://dx.doi.org/10.20965/jaciii.2012.p0076.

Full text

Abstract:

An Interest-based Ordering Scheme (IOS) for fuzzy morphology on White-Blood-Cell (WBC) image segmentation is proposed to improve accuracy of segmentation. The proposed method shows a high accuracy in segmenting both high- and low-density nuclei. Further, its running time is low, so it can be used for real applications. To evaluate the performance of the proposed method, 100 WBC images and 10 leukemia images are used, and the experimental results show that the proposed IOS segments a nucleus in WBC images 3.99% more accurately on average than the Lexicographical Ordering Scheme (LOS) does and 5

APA, Harvard, Vancouver, ISO, and other styles

15

Федорович, Олег Евгеньевич, Ксения Олеговна Западня та Олег Александрович Гайденко. "МЕТОДИ Й МОДЕЛІ ДОСЛІДЖЕННЯ ВІРТУАЛЬНИХ ВИРОБНИЦТВ, ОРІЄНТОВАНИХ НА ВИПУСК ВИСОКОТЕХНОЛОГІЧНОЇ ПРОДУКЦІЇ". Aerospace Technic and Technology, № 1 (28 січня 2017): 54–59. http://dx.doi.org/10.32620/aktt.2017.1.09.

Full text

Abstract:

The problem to create the virtual manufacturing system (VMS) for the manufacture of high-tech products (aeronautics, automotive, instrumentation, etc.) is stated and solved. In order to achieve the goal three phases that are logically linked to each other are outlined, such as the selection of VMS composition, preparing of the production of high-tech products to fulfill the orders portfolio, the arrangement of "supply - production - sales" logistics chain. The models and methods based on lexicographical ordering of the alternatives, linear integer programming with Boolean variables and agent-b

APA, Harvard, Vancouver, ISO, and other styles

16

Mentynska, Iryna. "STAGES OF ESTABLISHMENT OF COMPUTER TERMINOLOGY AGAINST THE BACKGROUND OF THE DEVELOPMENT OF INFORMATION TECHNOLOGIES IN UKRAINE." Theory and Practice of Teaching Ukrainian as a Foreign Language, no. 17 (June 25, 2023): 181–90. http://dx.doi.org/10.30970/ufl.2023.17.3927.

Full text

Abstract:

The article traces the formation of computer terminology against the background of the development of information technologies in Ukraine. Important stages of establishment of this field of knowledge are highlighted. Special attention is paid to the main lexicographical works, which became basic in the formation of the term system. The relevance of scientific research is determined by the need for a scientific description of the history of the development of Ukrainian computer terminology, as well as the need to determine the periodization of the formation of Ukrainian computer terminology. To

APA, Harvard, Vancouver, ISO, and other styles

17

Sezan, Ibrahim. "Image Recovery Using Set-Theoretic Methods." Proceedings, annual meeting, Electron Microscopy Society of America 48, no. 1 (1990): 446–47. http://dx.doi.org/10.1017/s0424820100180987.

Full text

Abstract:

Recently, there is some interest in the application of set-theoretic methods to the solution of the image recovery problem in electron microscopy. Several current studies have reported promising results.The purpose of this paper is to introduce set-theoretic methods to the electron microscopy community.In electron microscopy, the image recovery problem refers to obtaining an estimate of the ideal three-dimensional (3-D) image distribution from its incomplete and possibly noisy Fourier transform data.In the spatial domain, the recovery problem is stated on the basis of the observation equation:

APA, Harvard, Vancouver, ISO, and other styles

18

Ristic, Stana, Ivana Lazic-Konjik, and Nenad Ivanovic. "The metalanguage of a lexicographic definition in the descriptive dictionary (based on the dictionaries of the Serbian language)." Juznoslovenski filolog 74, no. 1 (2018): 81–96. http://dx.doi.org/10.2298/jfi1801081r.

Full text

Abstract:

In this paper we present the continuous hierarchical ordering of the first part of the definition of lexemes from the thematic group ?buildings? by analyzing the vertical organization of superordination of concepts in the lexicographical definition. We demonstrate that the vertical sequence mounts from a higher level of conceptual categorization, ?localizer,? in the form of complex and simple primitives (PLACE > SPACE [WHERE], SPACE > EXPANSE [SOMETHING THAT IS (BOUNDLESSLY) SPREADING IN EVERY DIRECTION]) and descends toward a lower hyperonimic level of ?buildings?. The suggested model l

APA, Harvard, Vancouver, ISO, and other styles

19

König, Jason. "RE-READING POLLUX: ENCYCLOPAEDIC STRUCTURE AND ATHLETIC CULTURE IN ONOMASTICON BOOK 3." Classical Quarterly 66, no. 1 (2016): 298–315. http://dx.doi.org/10.1017/s0009838816000331.

Full text

Abstract:

Ioulios Polydeukes, more commonly known as Pollux, was a Greek sophist and lexicographer active in the closing decades of the second century a.d. His Onomasticon is one of the most important lexicographical texts of the Imperial period. It is essentially a set of word lists dedicated to collecting clusters of related words on topics from a vast range of different areas of intellectual activity and everyday life. The text survives only in epitomized form, and shows signs of interpolation as well as abridgement. Nevertheless, the consensus is that the bulk of what survives is Pollux’ own work, a

APA, Harvard, Vancouver, ISO, and other styles

20

Melançon, Guy, and Christophe Reutenauer. "Lyndon Words, Free Algebras and Shuffles." Canadian Journal of Mathematics 41, no. 4 (1989): 577–91. http://dx.doi.org/10.4153/cjm-1989-025-2.

Full text

Abstract:

A Lyndon word is a primitive word which is minimum in its conjugation class, for the lexicographical ordering. These words have been introduced by Lyndon in order to find bases of the quotients of the lower central series of a free group or, equivalently, bases of the free Lie algebra [2], [7]. They have also many combinatorial properties, with applications to semigroups, pi-rings and pattern-matching, see [1], [10].We study here the Poincaré-Birkhoff-Witt basis constructed on the Lyndon basis (PBWL basis). We give an algorithm to write each word in this basis: it reads the word from right to

APA, Harvard, Vancouver, ISO, and other styles

21

BLOOM, S. L., and Z. ÉSIK. "ALGEBRAIC LINEAR ORDERINGS." International Journal of Foundations of Computer Science 22, no. 02 (2011): 491–515. http://dx.doi.org/10.1142/s0129054111008155.

Full text

Abstract:

An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the leaves of an algebraic tree. Using Courcelle's characterization of algebraic trees, we obtain the fact that a linear ordering is algebraic if and only if it can be represented as the lexicographic ordering of a deterministic context-free language.

APA, Harvard, Vancouver, ISO, and other styles

22

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

23

Semenova, Natalia V., Maria M. Lomaga, and Viktor V. Semenov. "LEXICOGRAPHIC PROBLEMS OF CONVEX OPTIMIZATION: SOLVABILITY AND OPTIMALITY CONDITIONS, CUTTING PLANE METHOD." Journal of Automation and Information sciences 1 (January 1, 2021): 30–40. http://dx.doi.org/10.34229/0572-2691-2021-1-3.

Full text

Abstract:

The lexicographic approach for solving multicriteria problems consists in the strict ordering of criteria concerning relative importance and allows to obtain optimization of more important criterion due to any losses of all another, to the criteria of less importance. Hence, a lot of problems including the ones of complex system optimization, of stochastic programming under risk, of dynamic character, etc. may be presented in the form of lexicographic problems of optimization. We have revealed conditions of existence and optimality of solutions of multicriteria problems of lexicographic opti

APA, Harvard, Vancouver, ISO, and other styles

24

Semenova, N. V., M. M. Lomaha, and V. V. Semenov. "Existence of solutions and solving method of lexicographic problem of convex optimization with the linear criteria functions." Reports of the National Academy of Sciences of Ukraine, no. 12 (December 2020): 19–27. http://dx.doi.org/10.15407/dopovidi2020.12.019.

Full text

Abstract:

Among vector problems, the lexicographic ones constitute a broad significant class of problems of optimization. Lexicographic ordering is applied to establish rules of subordination and priority. Hence, a lot of problems including the ones of complex system optimization, of stochastic programming under a risk, of the dynamic character, etc. may be presented in the form of lexicographic problems of optimization. We have revealed the conditions of existence of solutions of multicriteria of lexicographic optimization problems with an unbounded set of feasible solutions on the basis of applying th

APA, Harvard, Vancouver, ISO, and other styles

25

Iswar Mani Adhikari. "Lexicography in the Context of Evacuation Planning Issues." Kaumodaki: Journal of Multidisciplinary Studies 5, no. 1 (2025): 84–92. https://doi.org/10.3126/kdk.v5i1.73650.

Full text

Abstract:

Lexicography in evacuation planning refers to prioritizing and structuring the evacuation process in emergencies. It provides a systematic method for hierarchically addressing multiple objectives, ensuring that the most critical factors are resolved first. This work focuses on such an approach to the evacuation planning problem for the transit-based network. Lexicographically dynamic flow determines the optimal flow in a network like the maximum and minimum cost flow. The term lexicography is based on lexicographic ordering and refers to sorting or optimizing solutions in a way that respects a

APA, Harvard, Vancouver, ISO, and other styles

26

Sakamoto, Norihito. "Old and new joint characterizations of leximin and variants of rank-weighted utilitarianism." PLOS ONE 19, no. 1 (2024): e0296351. http://dx.doi.org/10.1371/journal.pone.0296351.

Full text

Abstract:

This paper proposes a new class of efficient and equitable social welfare orderings, a generalized leximin rule that includes rank-weighted utilitarianism, leximin, and their lexicographic compositions. While the famous Deschamps and Gevers’ joint characterization theorem shows that a Paretian, anonymous, separable social welfare ordering must be either weak utilitarianism, leximin, or leximax under the assumption of cardinal full comparability, this study provides a new joint characterization theorem in which imposing rank-separability, instead of separability, enables acceptable social welfa

APA, Harvard, Vancouver, ISO, and other styles

27

Hoggatt, V. E., and M. A. Owens. "Hoggatt Sequences and Lexicographic Ordering." Fibonacci Quarterly 25, no. 4 (1987): 322–32. http://dx.doi.org/10.1080/00150517.1987.12429675.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

COMON, HUBERT. "SOLVING SYMBOLIC ORDERING CONSTRAINTS." International Journal of Foundations of Computer Science 01, no. 04 (1990): 387–411. http://dx.doi.org/10.1142/s0129054190000278.

Full text

Abstract:

We show how to solve boolean combinations of inequations s>t in the Herbrand Universe, assuming that ≥ is interpreted as a lexicographic path ordering extending a total precedence. In other words, we prove that the existential fragment of the theory of a lexicographic path ordering which extends a total precedence is decidable.

APA, Harvard, Vancouver, ISO, and other styles

29

Kazymyrova, Iryna. "ARCHITECTONICS OF THE REGISTER OF THE HISTORICAL DICTIONARY OF LINGUISTIC TERMS." Terminological Bulletin, no. 6 (2021): 172–79. http://dx.doi.org/10.37919/2221-8807-2021-6-16.

Full text

Abstract:

The article is devoted to compiling a historical dictionary of linguistic terms, particularly the rules of the register’s organization. The importance of theoretical development of the principles of such a dictionary is emphasized, as the ordering of terminological systems should begin with the elucidation of the main tendencies of its historical evolution. One of the dictionary’s crucial components, which ensures access to the reader to the information contained in it, is its register. The article outlines the requirements for this fragment of the terminological dictionary. The scientific exp

APA, Harvard, Vancouver, ISO, and other styles

30

Law, Yat, Jimmy Lee, May Hiu Woo, and Toby Walsh. "A Comparison of Lex Bounds for Multiset Variables in Constraint Programming." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (2011): 61–67. http://dx.doi.org/10.1609/aaai.v25i1.7830.

Full text

Abstract:

Set and multiset variables in constraint programming have typically been represented using subset bounds. However, this is a weak representation that neglects potentially useful information about a set such as its cardinality. For set variables, the length-lex (LL) representation successfully provides information about the length (cardinality) and position in the lexicographic ordering. For multiset variables, where elements can be repeated, we consider richer representations that take into account additional information. We study eight different representations in which we maintain bounds acc

APA, Harvard, Vancouver, ISO, and other styles

31

Frisch, Alan M., Brahim Hnich, Zeynep Kiziltan, Ian Miguel, and Toby Walsh. "Propagation algorithms for lexicographic ordering constraints." Artificial Intelligence 170, no. 10 (2006): 803–34. http://dx.doi.org/10.1016/j.artint.2006.03.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Stork, P., and J. M. Viaene. "Policy optimization by lexicographic preference ordering." Journal of Policy Modeling 14, no. 5 (1992): 655–73. http://dx.doi.org/10.1016/0161-8938(92)90035-b.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Xue, Bo, Ji Cheng, Fei Liu, Yimu Wang, and Qingfu Zhang. "Multiobjective Lipschitz Bandits under Lexicographic Ordering." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 15 (2024): 16238–46. http://dx.doi.org/10.1609/aaai.v38i15.29558.

Full text

Abstract:

This paper studies the multiobjective bandit problem under lexicographic ordering, wherein the learner aims to simultaneously maximize ? objectives hierarchically. The only existing algorithm for this problem considers the multi-armed bandit model, and its regret bound is O((KT)^(2/3)) under a metric called priority-based regret. However, this bound is suboptimal, as the lower bound for single objective multi-armed bandits is Omega(KlogT). Moreover, this bound becomes vacuous when the arm number K is infinite. To address these limitations, we investigate the multiobjective Lipschitz bandit mod

APA, Harvard, Vancouver, ISO, and other styles

34

Er, M. C. "Lexicographic ordering, ranking and unranking of combinations." International Journal of Computer Mathematics 17, no. 3-4 (1985): 277–83. http://dx.doi.org/10.1080/00207168508803468.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Jee, Kyung-Wook, Daniel L. McShan, and Benedick A. Fraass. "Lexicographic ordering: intuitive multicriteria optimization for IMRT." Physics in Medicine and Biology 52, no. 7 (2007): 1845–61. http://dx.doi.org/10.1088/0031-9155/52/7/006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Sadler, D. Royce. "Lexicographic Decision Rules and Selection for Higher Education." Australian Journal of Education 33, no. 2 (1989): 114–26. http://dx.doi.org/10.1177/168781408903300202.

Full text

Abstract:

Currently in Australia, there is a strong demand for places in higher education. At the same time, a variety of methods of measuring and scaling secondary school achievements are used in the different states for making selection decisions, and these methods come under both professional and public scrutiny. A sequential screening procedure has recently been proposed in Queensland. It is based on what is known in decision theory as a ‘lexicographic ordering’. In this article, the concept of a lexicographic ordering is explained, and some of the associated assumptions, implications and shortcomin

APA, Harvard, Vancouver, ISO, and other styles

37

Rizza, Davide. "Nonstandard utilities for lexicographically decomposable orderings." Journal of Mathematical Economics 60 (October 2015): 105–9. http://dx.doi.org/10.1016/j.jmateco.2015.06.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Adams, Warren, Pietro Belotti, and Ruobing Shen. "Convex hull characterizations of lexicographic orderings." Journal of Global Optimization 66, no. 2 (2016): 311–29. http://dx.doi.org/10.1007/s10898-016-0435-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

P, Phani Bushan Rao, and Ravi Shankar Nowpada. "Fuzzy Critical Path Method Based on Lexicographic Ordering." Pakistan Journal of Statistics and Operation Research 8, no. 1 (2012): 139. http://dx.doi.org/10.18187/pjsor.v8i1.178.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

ÉSIK, ZOLTÁN. "ORDINAL AUTOMATA AND CANTOR NORMAL FORM." International Journal of Foundations of Computer Science 23, no. 01 (2012): 87–98. http://dx.doi.org/10.1142/s0129054112400060.

Full text

Abstract:

It is known that an ordinal is the order type of the lexicographic ordering of a regular language if and only if it is less than ωω. We design a polynomial time algorithm that constructs, for each well-ordered regular language L with respect to the lexicographic ordering, given by a deterministic finite automaton, the Cantor Normal Form of its order type. It follows that there is a polynomial time algorithm to decide whether two deterministic finite automata accepting well-ordered regular languages accept isomorphic languages. We also give estimates on the state complexity of the smallest "ord

APA, Harvard, Vancouver, ISO, and other styles

41

Conversano, Claudio, and Roberta Siciliano. "Incremental Tree-Based Missing Data Imputation with Lexicographic Ordering." Journal of Classification 26, no. 3 (2009): 361–79. http://dx.doi.org/10.1007/s00357-009-9038-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Sergeyev, Yaroslav D. "The Olympic Medals Ranks, Lexicographic Ordering, and Numerical Infinities." Mathematical Intelligencer 37, no. 2 (2015): 4–8. http://dx.doi.org/10.1007/s00283-014-9511-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Saliba, Sleman. "Heuristics for the lexicographic max-ordering vehicle routing problem." Central European Journal of Operations Research 14, no. 3 (2006): 313–36. http://dx.doi.org/10.1007/s10100-006-0007-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Roumasset, James. "Lexicographic Ordering and Loss Aversion among Low-Income Farmers." Journal of Economic Behavior & Organization 217 (January 2024): 483–92. http://dx.doi.org/10.1016/j.jebo.2023.10.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Krishnamurthy, E. V., and B. P. Vickers. "Compact numeral representation with combinators." Journal of Symbolic Logic 52, no. 2 (1987): 519–25. http://dx.doi.org/10.2307/2274398.

Full text

Abstract:

AbstractThis paper is concerned with the combinator representation of numeral systems with logarithmic space complexity of symbols. The principle used is based on the lexicographic ordering of words over a finite alphabet.

APA, Harvard, Vancouver, ISO, and other styles

46

Gupte, Akshay. "Convex hulls of superincreasing knapsacks and lexicographic orderings." Discrete Applied Mathematics 201 (March 2016): 150–63. http://dx.doi.org/10.1016/j.dam.2015.08.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Zobnin, A. I. "One-element differential standard bases with respect to inverse lexicographical orderings." Journal of Mathematical Sciences 163, no. 5 (2009): 523–33. http://dx.doi.org/10.1007/s10958-009-9690-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Spoletini, E. "Generation of Permutations in Direct Lexicographic Ordering by Arithmetic Methods." Computer Journal 28, no. 4 (1985): 444–45. http://dx.doi.org/10.1093/comjnl/28.4.444.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Long, T., M. Matuszak, M. Feng, B. A. Fraass, R. K. Ten Haken, and H. E. Romeijn. "Sensitivity analysis for lexicographic ordering in radiation therapy treatment planning." Medical Physics 39, no. 6Part1 (2012): 3445–55. http://dx.doi.org/10.1118/1.4720218.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Doğan, Battal, and Kemal Yildiz. "Choice with Affirmative Action." Management Science 69, no. 4 (2023): 2284–96. http://dx.doi.org/10.1287/mnsc.2022.4447.

Full text

Abstract:

A choice rule with affirmative action decides on the recipients of a limited number of identical objects by reconciling two objectives: respecting a priority ordering over the applicants and supporting a minority group. We extend the standard formulation of a choice problem by incorporating a type function and a priority ordering and introduce monotonicity axioms on how a choice rule should respond to variations in these parameters. We show that monotonic and substitutable affirmative action rules are the ones that admit a bounded reserve representation. As a prominent class of choice rules th

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!