Results 51 to 60 of about 38,638 (199)

Anselm's Temporal‐Ontological Proof

open access: yesNoûs, EarlyView.
ABSTRACT In his Reply to Gaunilo, Anselm presented two additional arguments for the existence of God beyond those that appear in the Proslogion. In “The Logical Structure of Anselm's Argument,” Robert M. Adams isolates each. One, he develops into a modal ontological argument along the lines of other 20th century ontological arguments (e.g., those of ...
Daniel Rubio
wiley   +1 more source

WE, ELF and ELT: Perspectives on English and applied linguistics

open access: yesWorld Englishes, EarlyView.
Abstract In a paper which originally set the scene for WE study, Braj Kachu argued that the ‘global diffusion of English’ called for a new paradigm of enquiry which recognized the independent status of varieties of English used by communities other than those of Inner Circle native speakers.
Henry Widdowson
wiley   +1 more source

Fuzzy-Relation-Based Lexicographic Minimum Solution to the P2P Network System

open access: yesIEEE Access, 2020
In the existing work in the literature, the addition-min fuzzy relation inequalities was applied to describe a peer-to-peer (P2P) network system. In such a model, the total download traffic of a terminal was considered.
Yanbo Ma, Xiaobin Yang, Bing-Yuan Cao
doaj   +1 more source

The first-order theory of lexicographic path orderings is undecidable

open access: yesTheoretical Computer Science, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Comon, Hubert, Treinen, Ralf
openaire   +2 more sources

Finding a mix of renewable energy for different stakeholders by applying multi‐criteria decision‐making techniques

open access: yesInternational 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

COMPONENT COMPOSITION OF NEOLOGISMS-ICT TERMS

open access: yesSovremennye Issledovaniâ Socialʹnyh Problem, 2022
Purpose. This study is devoted to the description and analysis of the component composition of neologisms-ICT terms. Methods. In the course of the research, a theoretical analysis of the scientific literature on the subject under study was carried out.
Yuliya A. Husnullina
doaj   +1 more source

Competitive on-line learning with a convex loss function [PDF]

open access: yes, 2005
We consider the problem of sequential decision making under uncertainty in which the loss caused by a decision depends on the following binary observation. In competitive on-line learning, the goal is to design decision algorithms that are almost as good
Vovk, Vladimir
core   +3 more sources

Modeling and generating user‐centered contrastive explanations for the workforce scheduling and routing problem

open access: yesInternational 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

Ways of Development of Slavic Onomastic Lexicography: An Analytical Overview

open access: yesВопросы ономастики, 2021
The article examines the history and current state of onomastic lexicography in the Slavic countries. The study is driven by the importance of collecting data on Slavic dictionaries of proper names for in-depth research on the theory of Slavic onomastics
Irina. V. Kryukova, Vasily I. Suprun
doaj   +1 more source

Discrepancy of arithmetic progressions in boxes and convex bodies

open access: yesMathematika, 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

Home - About - Disclaimer - Privacy