Results 31 to 40 of about 1,123 (207)

Towards Characterization of Five‐List‐Colorability of Toroidal Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT Through computer‐assisted enumeration, we list minimal obstructions for 5‐choosability of graphs on the torus with the following additional property: There exists a cyclic system of non‐contractible triangles around the torus where the consecutive triangles are at distance at most four.
Zdeněk Dvořák   +1 more
wiley   +1 more source

Lexicographical Contextualization and Personalization: A New Perspective

open access: yesLexikos, 2019
Contextualization, i.e. to provide solutions to users' information needs directly in the situation or context where these needs occur, played a significant role in the work of the Greek scribes who inserted glosses into manuscript copies of the works of ...
Sven Tarp
doaj   +1 more source

Solving for Blameless and Optimal Control Under Prioritized Safety Constraints

open access: yesOptimal Control Applications and Methods, EarlyView.
Summary of the proposed method for solving for blameless and optimal control sequences. ABSTRACT In many safety‐critical optimal control problems, users may request multiple safety constraints that are jointly infeasible due to external factors such as subsystem failures, unexpected disturbances, or fuel limitations.
Natalia Pavlasek   +3 more
wiley   +1 more source

Tähenduste seletamine leksikograafias: kuivõrd on abi suurtest keelemudelitest?

open access: yesEesti ja Soome-ugri Keeleteaduse Ajakiri
Artiklis uurime, kas ja mil määral saavad suured keelemudelid (SKMid) leksikograafi aidata sõnastikuseletuste loomisel ja sõnatähendus(t)e esitusel. Katsetatud SKMidest jäid lõplikku hindamisküsitlusse GPT-4o ja Gemini 1.5 Pro tähendusseletused 60 sõna ...
Maria Tuulik   +6 more
doaj   +1 more source

Towards a Typology of Definitions for LSP Dictionaries

open access: yesJournal of English Studies, 2011
Definitions are the pivotal parts of dictionaries. Every lexicographer always strives to write definitions which are not only accurate but also comprehensible to dictionary users.
Deny Arnos Kwary
doaj   +1 more source

On lexicographical networks

open access: yes, 2018
In this study, we analyze various aspects of lexicographical networks. We would like to answer our research questions of what are the characteristics of the lexicographical networks? In addition to the existing notions of networks analysis, what new notions can be defined to describe such networks?
Ahmadi, Sina   +2 more
openaire   +2 more sources

From Nominalisation to Passive in Old Tibetan: Reconstructing Grammatical Meaning in an Extinct Language1

open access: yesTransactions of the Philological Society, EarlyView.
Abstract Based on an analysis of the Old Literary Tibetan corpus—a corpus of the oldest documented Tibetic language—the present study provides evidence that literary Tibetan v3 verb stems (commonly termed ‘future’) initially encoded passive voice. New arguments put forward in this article range from Trans‐Himalayan nominal morphology to early Tibetan ...
Joanna Bialek
wiley   +1 more source

Representable Lexicographic Products

open access: yesOrder, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Boolean lexicographic optimization: algorithms & applications [PDF]

open access: yesAnnals of Mathematics and Artificial Intelligence, 2011
This work was partially funded by SFI PI Grant 09/IN.1/I2618, EU grants FP7-ICT-217069 and FP7-ICT-214898, FCT grant ATTEST (CMU-PT/ELE/0009/2009), FCT PhD grant SFRH/BD/ 28599/2006, CICYT Projects TIN2009-14704-C03-01 and TIN2010-20967-C04-03, and by INESC-ID multiannual funding from the PIDDAC program funds.
Marques-Silva, Joao   +3 more
openaire   +2 more sources

Exact solution algorithms for biobjective mixed integer programming problems

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points. When exploring, the algorithm exploits information on its corner points and chooses the scalarization problem
Deniz Emre, Özlem Karsu, Firdevs Ulus
wiley   +1 more source

Home - About - Disclaimer - Privacy