Relevant bibliographies by topics / Lexicographical ordering

Academic literature on the topic 'Lexicographical ordering'

Author: Grafiati
Published: 6 September 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Lexicographical ordering"

1

Tung, Cheng-Tan. "Note on lexicographical ordering." International journal of Emerging Trends in Science and Technology 04, no. 05 (May 12, 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 (December 1, 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 (January 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 (March 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 (May 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 (January 10, 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 outperforms the previously studied ones with the same experimental setup. Overall, we conclude that constructing insightful dynamic variable ordering heuristics that also utilize a dynamic value ordering heuristic in their decision making process could drastically improve the search effort for some constraint satisfaction problems.
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 (May 26, 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 (December 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 (August 30, 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 lexicography: users, user situation, user needs, and dictionary assistance. This paper focuses on dictionary assistance and addresses several lexicographical issues connected with polysemy: the selection of the lemmata of some printed English-Spanish/Spanish-English business dictionaries, their entry structures, sense differentiation, and sense ordering. The analysis leads the author to discuss some proposals with the aim of making business dictionaries more pedagogically oriented, and to include a set of principles pedagogically-oriented business dictionaries must have. They are illustrated in a model entry which has been compiled by rearranging one of the entries studied according to the proposals and principles previously discussed.
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
More sources

Dissertations / Theses on the topic "Lexicographical ordering"

1

Kamanchi, Chandramouli. "Algorithms for Stochastic Optimization, Statistical Estimation and Markov Decision Processes." Thesis, 2020. https://etd.iisc.ac.in/handle/2005/4645.

Full text
Abstract:
Stochastic approximation deals with the problem of finding zeros of a function expressed as an expectation of a random variable. In this thesis we propose convergent algorithms for problems in optimization, statistical estimation and reinforcement learning. We first formulate these problems in the stochastic approximation setting. Subsequently we utilize the ordinary differential equations based analysis of stochastic approximation algorithms to prove the convergence of our proposed algorithms. Additionally we explore second order methods in the context of Markov Decision Processes. Through experimental evaluations, we validate our theoretical results. First, we consider a Stochastic Optimization (SO) problem where the aim is to optimize a given objective function in the presence of noise. Most of the solution techniques in SO estimate gradients from the noise corrupted observations of the objective and adjust parameters of the objective along the direction of the estimated gradients to obtain locally optimal solutions. Two prominent algorithms in SO namely Random Direction Kiefer-Wolfowitz (RDKW) and Simultaneous Perturbation Stochastic Approximation (SPSA) obtain noisy gradient estimates by randomly perturbing all the parameters simultaneously. This forces the search direction to be random in these algorithms and causes them to suffer additional noise on top of the noise incurred from the samples of the objective. Owing to this additional noise, the idea of using deterministic perturbations instead of random perturbations for gradient estimation has also been studied in the past. Specifically, two constructions of the deterministic perturbation sequence using lexicographical ordering and Hadamard matrices have been explored in the context of SPSA algorithms and encouraging results have been reported in the literature. In our work, we characterize the class of deterministic perturbation sequences that can be utilized in the RDKW algorithm. This class expands the set of known deterministic perturbation sequences available in the literature. Using our characterization we propose a construction of a deterministic perturbation sequence that has the least possible cycle length among all deterministic perturbations. We establish the convergence of the RDKW algorithm for the generalized class of deterministic perturbations utilizing stochastic approximation techniques. Through simulations we illustrate the performance gain of the proposed deterministic perturbation sequence in the RDKW algorithm over the Hadamard and the random perturbation counterparts. Next, we consider the problem of estimating the mode of a density function utilizing only the samples from this density. One of the popular measures of central tendency that provides better representation and interesting insights of the data compared to the other measures like mean and median is the mode. If the analytical form of the density function is known, mode is an argument of the maximum value of the density function and one can apply optimization techniques to find the mode. In many of the practical applications, the analytical form of the density is not known and only the samples from the distribution are available. Most of the techniques proposed in the literature for estimating the mode from data samples assume that all the samples are available beforehand. Moreover, some of the techniques employ computationally expensive operations like sorting. In our work, we provide a computationally effective, on-line, iterative algorithm that estimates the mode of a unimodal smooth density given only the samples generated from the density. Asymptotic convergence of the proposed algorithm using an ordinary differential equation (ODE) based analysis is provided. We also prove the stability of estimates by utilizing the concept of regularization. Experimental results further demonstrate the effectiveness of our proposed algorithm. In the third part of our thesis, we propose a learning algorithm to solve a reinforcement learning problem. In a discounted reward Markov Decision Process (MDP), the objective is to find the optimal value function, i.e., the value function corresponding to an optimal policy. This problem reduces to solving a functional equation known as the Bellman equation and a fixed point iteration scheme known as the value iteration is utilized to obtain the solution. In literature, a successive over-relaxation based value iteration scheme is proposed to speed-up the computation of the optimal value function. The speed-up is achieved by constructing a modified Bellman equation that ensures faster convergence to the optimal value function. However, in many practical applications, the model information is not known and we resort to reinforcement learning algorithms to estimate the optimal policy and value function. One such popular algorithm is Q-learning. In our work, we propose a novel Successive Over-Relaxation (SOR) Q-learning algorithm. We first derive a modified fixed point iteration for SOR Q-values and utilize stochastic approximation to derive a learning algorithm to compute the optimal value function and an optimal policy. We then prove the almost sure convergence of the SOR Q-learning algorithm to SOR Q-values. Through numerical experiments, we show that our proposed SOR Q-learning algorithm is faster compared to the standard Q-learning algorithm. Finally, we explore second order methods in Markov Decision Processes (MDPs). Value iteration is a fixed point iteration technique utilized to obtain the optimal value function and policy in a discounted reward MDP. Here, a contraction operator is constructed and applied recursively to arrive at the optimal solution. Value iteration is a first order method and therefore it may take a large number of iterations to converge to the optimal solution. As discussed above, successive relaxation is a popular technique that can be applied to solve a fixed point equation. It has been shown in the literature that under a special structure of the MDP, the successive over-relaxation technique computes the optimal value function faster than standard value iteration. In our work, we propose a second order value iteration procedure that is obtained by applying the Newton-Raphson method to the successive relaxation value iteration scheme. We prove the global convergence of our algorithm to the optimal solution asymptotically and show the second order convergence. Through experiments, we then demonstrate the effectiveness of our proposed approach
APA, Harvard, Vancouver, ISO, and other styles
2

"Shellability of the Bruhat Order on Borel Orbit Closures." Tulane University, 2013.

Find full text
Abstract:
Involutions and fixed-point-free involutions arise naturally as representatives for certain Borel orbits in invertible matrices. Similarly, partial involutions and partial fixed-point-free involutions represent certain Borel orbits in matrices which are not necessarily invertible. Inclusion relations among Borel orbit closures induce a partial order on these discrete parameterizing sets. In this dissertation we investigate the associated order complex of these posets. In particular, we prove that the order complex of the Bruhat poset of Borel orbit closures is shellable in symmetric as well as skew-symmetric matrices.
acase@tulane.edu
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Lexicographical ordering"

1

Bilgrami, Akeel. Jawaharlal Nehru, Mohandas Gandhi, and the Contexts of Indian Secularism. Edited by Jonardon Ganeri. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199314621.013.40.

Full text
Abstract:
Jawaharlal Nehru and Mohandas Gandhi shared the view that India’s nationalism made secularism unnecessary, for secularism is a notion whose conceptual genealogy is in a specific historical context, an idea designed to repair the damaging effects of European nation-state formation. An alternative Indian nationalism was to consist in a reconstruction of what they took to be India’s unselfconsciously pluralist traditions; the genuine and lived pluralism of ordinary Indian social life was to be replayed in the political arena of anti-imperialism. Secularism, both in Europe and post-Independence India, consists not in neutrality among religions but in a lexicographical ordering between the commitments to freedom of religion and to fundamental constitutional rights. The exception granted by the Indian state to Muslim personal law ought not to be seen as a denial of secularism but as a suspension of the secular ideal in the context of the history of a collective human subject.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Lexicographical ordering"

1

Blackorby, Charles. "Lexicographic Orderings." In The New Palgrave Dictionary of Economics, 7794–95. London: Palgrave Macmillan UK, 2018. http://dx.doi.org/10.1057/978-1-349-95189-5_739.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Blackorby, C. "Lexicographic Orderings." In The New Palgrave Dictionary of Economics, 1–2. London: Palgrave Macmillan UK, 1987. http://dx.doi.org/10.1057/978-1-349-95121-5_739-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Blackorby, Charles. "Lexicographic Orderings." In The New Palgrave Dictionary of Economics, 1–2. London: Palgrave Macmillan UK, 2008. http://dx.doi.org/10.1057/978-1-349-95121-5_739-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Blackorby, C. "Lexicographic Orderings." In Utility and Probability, 134–35. London: Palgrave Macmillan UK, 1990. http://dx.doi.org/10.1007/978-1-349-20568-4_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Frisch, Alan, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, and Toby Walsh. "Global Constraints for Lexicographic Orderings." In Lecture Notes in Computer Science, 93–108. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-46135-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Clampitt, David. "Lexicographic Orderings of Modes and Morphisms." In Computational Music Science, 89–97. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-47337-6_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Aribi, Noureddine, and Yahia Lebbah. "Exact Approaches for Parameter Elicitation in Lexicographic Ordering." In Algorithmic Decision Theory, 45–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41575-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bonfante, Guillaume, Jean-Yves Marion, and Jean-Yves Moyen. "On Lexicographic Termination Ordering with Space Bound Certifications." In Lecture Notes in Computer Science, 482–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45575-2_46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Castro-Gutierrez, Juan, Dario Landa-Silva, and José Moreno Pérez. "Improved Dynamic Lexicographic Ordering for Multi-Objective Optimisation." In Parallel Problem Solving from Nature, PPSN XI, 31–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15871-1_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Veronesi, Pietro. "Lexicographic Rationality Orderings and Iterative Weak Dominance." In Decisions, Games and Markets, 125–47. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6337-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Lexicographical ordering"

1

Tang, Hongzhong, Huixian Huang, Yewei Xiao, and Xuefeng Guo. "Morphological color image processing based on improved distance and lexicographical ordering." In International Conference on Image Processing and Pattern Recognition in Industrial Engineering, edited by Zhengyu Du and Bin Liu. SPIE, 2010. http://dx.doi.org/10.1117/12.866472.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Heisterkamp, Douglas, and Jesse Johnson. "Pinch Ratio Clustering from a Topologically Intrinsic Lexicographic Ordering." In Proceedings of the 2013 SIAM International Conference on Data Mining. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611972832.62.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ivanovici, Mihai, and Radu-Mihai Coliban. "Spectral Signature Ranking based on Lexicographic Ordering of Autocorrelation Function Values." In 2019 International Symposium on Signals, Circuits and Systems (ISSCS). IEEE, 2019. http://dx.doi.org/10.1109/isscs.2019.8801771.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wei, Feng, Shimin Wei, Ying Zhang, and Qizheng Liao. "On the Solution of Five-Precision-Points Path Synthesis of Planar Four-Bar Linkages Using Algebraic Method." In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-59034.

Full text
Abstract:
The problem of five precision points path synthesis of planar four-bar linkage can be divided into four types in term of the input parameters. A unified formulation for the four types is built based on the planar displacement matrix. Next, the corresponding resultant matrix is constructed based on Groebner bases generated by applying the new term ordering (the groups graded reverse lexicographic ordering, <ggrevlex) for four types. Then, a high-degree univariate polynomial equation is accordingly obtained. At last, several examples are provided to validate the algorithm and the solutions are verified in the software SAM. And it is concluded that type I has 36 solutions, type II has 64 including 16 degenerate solutions, type III has 92 solutions and type IV has 82 solutions including 16 degenerate solutions.
APA, Harvard, Vancouver, ISO, and other styles
5

Krnc, Matjaž, and Nevena Pivač. "Graphs where Search Methods are Indistinguishable." In 7th Student Computer Science Research Conference. University of Maribor Press, 2021. http://dx.doi.org/10.18690/978-961-286-516-0.3.

Full text
Abstract:
Graph searching is one of the simplest and most widely used tools in graph algorithms. Every graph search method is defined using some partic-ular selection rule, and the analysis of the corre-sponding vertex orderings can aid greatly in de-vising algorithms, writing proofs of correctness, or recognition of various graph families. We study graphs where the sets of vertex order-ings produced by two di˙erent search methods coincide. We characterise such graph families for ten pairs from the best-known set of graph searches: Breadth First Search (BFS), Depth First Search (DFS), Lexicographic Breadth First Search (LexBFS) and Lexicographic Depth First Search (LexDFS), and Maximal Neighborhood Search (MNS).
APA, Harvard, Vancouver, ISO, and other styles
6

Talebian, Seyed Hamid, and Sameem Abdul Kareem. "A Lexicographic Ordering Genetic Algorithm for Solving Multi-objective View Selection Problem." In 2010 Second International Conference on Computer Research and Development. IEEE, 2010. http://dx.doi.org/10.1109/iccrd.2010.81.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Anilkumar, Markana, Nitin Padhiyar, and Kannan Moudgalya. "Prioritized Control of Multivariate Process using Lexicographic Ordering Approach: A Simulation Study." In 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT). IEEE, 2019. http://dx.doi.org/10.1109/codit.2019.8820537.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ivanovici, Mihai, Maria Marincas, and Radu-Mihai Coliban. "A Vector Median Filter For Hyperspectral Images Based On Lexicographic Ordering of Estimated Auto-Correlation Functions." In 2021 11th Workshop on Hyperspectral Imaging and Signal Processing: Evolution in Remote Sensing (WHISPERS). IEEE, 2021. http://dx.doi.org/10.1109/whispers52202.2021.9483963.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kumar, Mohit, Stefano Teso, and Luc De Raedt. "Acquiring Integer Programs from Data." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/158.

Full text
Abstract:
Integer programming (IP) is widely used within operations research to model and solve complex combinatorial problems such as personnel rostering and assignment problems. Modelling such problems is difficult for non-experts and expensive when hiring domain experts to perform the modelling. For many tasks, however, examples of working solutions are readily available. We propose ARNOLD, an approach that partially automates the modelling step by learning an integer program from example solutions. Contrary to existing alternatives, ARNOLD natively handles multi-dimensional quantities and non-linear operations, which are at the core of IP problems, and it only requires examples of feasible solution. The main challenge is to efficiently explore the space of possible programs. Our approach pairs a general-to-specific traversal strategy with a nested lexicographic ordering in order to prune large portions of the space of candidate constraints while avoiding visiting the same candidate multiple times. Our empirical evaluation shows that ARNOLD can acquire models for a number of realistic benchmark problems
APA, Harvard, Vancouver, ISO, and other styles
10

Dhingra, A. K., A. N. Almadi, and D. Kohli. "A Gröbner-Sylvester Hybrid Method for Closed-Form Displacement Analysis of Mechanisms." In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/mech-5969.

Full text
Abstract:
Abstract The displacement analysis problem for planar and spatial mechanisms can be written as a system of multivariate polynomial equations. Elimination theory based on resultants and polynomial continuation are some of the methods which have been used to solve this problem. This paper presents a new approach to displacement analysis using the reduced Gröbner basis form of a system of equations under degree lexicographic (dlex) term ordering of its monomials and Sylvester’s Dialytic elimination method. Using the Gröbner-Sylvester hybrid approach, a finitely solvable system of equations F is transformed into its reduced Gröbner basis G using dlex term ordering. Next, using the entire or a subset of the set of generators in G, the Sylvester’s matrix is assembled. The vanishing of the resultant, given as the determinant of Sylvester’s matrix, yields the necessary and sufficient condition for the polynomials in G (as well as F) to have a common factor. The proposed approach appears to provide a systematic and rational procedure to the problem discussed by Roth (1994) dealing with the generation of (additional) equations for constructing the Sylvester’s matrix. Three examples illustrating the applicability of the proposed approach to displacement analysis of planar and spatial mechanisms are presented. The first and second examples deal with forward displacement analysis of the general 6-6 Stewart mechanism and the 6-6 Stewart platform, whereas the third example deals with the determination of the input-output polynomial of a 8-link 1-DOF mechanism which does not contain any 4-link loops.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Lexicographical ordering' for particular source types:
Journal articles
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!

To the bibliography