Results 81 to 90 of about 1,234 (232)
On the lexicographic ordered spaces
Topology and its Applications, 2017 Abstract In this paper, we discuss the lexicographic ordered topologies on some products. We mainly prove: (1) The lexicographic ordered space λ γ is base-normal for any ordinals λ and γ. (2) The lexicographic ordered space [ 0 , 1 ) γ is Lindelof for each ordinal γ ≤ ω 1 .
openaire +1 more source
Generative Semantic Communication for Efficient Utilization of Satellite Resources in 6G
International Journal of Satellite Communications and Networking, Volume 44, Issue 4, Page 368-377, July/August 2026.ABSTRACT In this paper, a two‐stage resource allocation framework is proposed for generative semantic communication (GSC)–enabled multibeam satellite systems. By integrating semantic compression and generative artificial intelligence, GSC enables efficient downlink transmission by allowing users to reconstruct content from compressed semantic prompts ...
Hyein Lee +5 more
wiley +1 more source
Automated static symmetry breaking in constraint satisfaction problems
, 2011 Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic ordering constraints. Existing general methods of generating such sets of ordering constraints can produce a huge number of additional constraints. This adds
Grayland, Andrews
core
The first-order theory of lexicographic path orderings is undecidable
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Comon, Hubert, Treinen, Ralf
openaire +2 more sources
Expert Systems, Volume 43, Issue 7, July 2026.ABSTRACT Fault‐tolerant monitoring and reliable node identification are essential requirements in modern hierarchical communication systems such as IoT–Fog–Cloud architectures and distributed sensing networks. The fault‐tolerant metric dimension (FTMD) provides an effective graph‐theoretic framework for resilient localization and monitoring in such ...
Ghulam Haidar +5 more
wiley +1 more source
A theorem on refining division orders by the reverse lexicographic order
Duke Mathematical Journal, 1987 If \(S_ d\) is the K-vector space of homogeneous polynomials of degree d in \(S=k[x_ 1,...,x_ n]\), where K is an infinite field, then a (partial) order \(>\) on the monomials of \(S_ d\) for each d is compatible with the monoid structure of the monomials of S if \(x^ A>x^ B\) implies \(x^ Cx^ A>x^ Cx^ B\) for all monomials \(x^ C\). If the order \(>\)
Bayer, David, Stillman, Michael
openaire +2 more sources
International Transactions in Operational Research, Volume 33, Issue 4, Page 2499-2534, July 2026.Abstract This paper presents a two‐stage model for planning a renewable energy portfolio by balancing economic, social and environmental sustainability goals. The first stage addresses a multi‐objective problem where conflictive impacts generated by the energy portfolios should be optimised according to the corresponding economic, social or ...
Amelia Bilbao‐Terol +2 more
wiley +1 more source
A Characterization of Lexicographic Max-Ordering Solutions
, 1996 In this paper we give the definition of a solution concept in multicriteria combinatorial optimization. We show how Pareto, max-ordering and lexicographically optimal solutions can be incorporated in this framework.
Matthias Ehrgott
core
The Olympic medals ranks, lexicographic ordering and numerical infinities [PDF]
, 2015 Several ways used to rank countries with respect to medals won during Olympic Games are discussed. In particular, it is shown that the unofficial rank used by the Olympic Committee is the only rank that does not allow one to
Sergeyev, Yaroslav
core
Discrete Decision Problems, Multiple Criteria Optimization Classes and Lexicographic Max-Ordering [PDF]
, 1998 The topic of this paper are discrete decision problems with multiple criteria. We first define discrete multiple criteria decision problems and introduce a classification scheme for multiple criteria optimization problems.
Matthias Ehrgott, Ehrgott, Matthias
core +1 more source