Results 51 to 60 of about 1,123 (207)
World Englishes and applied linguistics: Theoretical and applied perspectives
World Englishes, EarlyView.Abstract This article examines the evolving relationship between world Englishes (WE) and applied linguistics (AL), tracing AL's historical development from its Anglo‐American origins in the mid‐20th century, grounded in “linguistics applied” to its contemporary status as a multidisciplinary field concerned with social justice and equity. It highlights
Kingsley Bolton
wiley +1 more source
Translating the suffix -ism in linguistics terminology from English into Arabic
JoSTrans: The Journal of Specialised Translation, 2017 English relies heavily on suffixation in deriving new words. The suffix -ism is used to form nouns in both general and specialised languages. In linguistics terminology, -ism is used to denote a range of technical concepts.
Jamal Mohamed Giaber
doaj +1 more source
Journal of Mathematical PsychologyzbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
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
The team orienteering problem with variable time windows
International Transactions in Operational Research, Volume 33, Issue 3, Page 1705-1732, May 2026.Abstract The orienteering problem is well‐established within the domain of operational research. This paper introduces the team orienteering problem with variable time windows (TOPVTW) as a new variant of the team orienteering problem with time windows. The distinguishing feature of the TOPVTW is the adaptive time windows, which evolve dynamically as a
Bibiana Granda, Begoña Vitoriano
wiley +1 more source
Who can Really be Called a Lexicographer?
Lexikos, 2012 Lexicographers define words but still lack a clear and unambiguous understanding of the word lexicographer. This paper gives a brief discussion of the problems experienced in trying to determine exactly what a lexicographer is.
Rufus H. Gouws
doaj
International Transactions in Operational Research, Volume 33, Issue 3, Page 1525-1558, May 2026.Abstract In the last decade, explainability has been attracting much attention in the machine learning community. However, this research topic extends beyond this field to encompass others such as operations research and combinatorial optimization (CO).
Mathieu Lerouge +3 more
wiley +1 more source
Anytime Lexicographic Enumeration of the Pareto Front in Multi‐Objective Combinatorial Optimisation
Journal of Multi-Criteria Decision Analysis, Volume 33, Issue 1, April 2026.ABSTRACT Multi‐objective combinatorial optimisation problems are widespread in real‐world scenarios, including resource allocation, scheduling and logistics, where multiple competing objectives need to be optimised simultaneously. In industrial contexts, lexicographic optimisation is often used to solve these problems, requiring the decision‐maker (DM)
Marco Foschini +3 more
wiley +1 more source
Networks, Volume 87, Issue 3, Page 312-321, April 2026.ABSTRACT The minimum s$$ s $$‐t$$ t $$‐cut problem is one of the most‐studied problems in discrete optimization and has a unique complexity status in multi‐objective optimization. Even though the single‐objective version of the problem can be solved in polynomial time, it has been shown in the seminal work of Papadimitriou and Yannakakis (2000) that ...
Jan Boeckmann +4 more
wiley +1 more source
Discrepancy of arithmetic progressions in boxes and convex bodies
Mathematika, Volume 72, Issue 2, April 2026.Abstract The combinatorial discrepancy of arithmetic progressions inside [N]:={1,…,N}$[N]:= \lbrace 1, \ldots, N\rbrace$ is the smallest integer D$D$ for which [N]$[N]$ can be colored with two colors so that any arithmetic progression in [N]$[N]$ contains at most D$D$ more elements from one color class than the other.
Lily Li, Aleksandar Nikolov
wiley +1 more source