Results 81 to 90 of about 4,373 (234)
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
Networks, EarlyView.ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
Hairdressing in groups: a survey of combings and formal languages
, 1997 A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language.
Rees, Sarah
core +1 more source
Recursively enumerable languages and van Wijngaarden grammars
Indagationes Mathematicae (Proceedings), 1977 AbstractWe show that each re language can be generated by a minimal deterministic linear contextfree based strict normal VW-grammar. We also prove that each re language can be generated by a strict normal VW-grammar with at most one metanotion denoting a non-regular contextfree language.
openaire +2 more sources
People and Nature, Volume 8, Issue 6, Page 1785-1801, June 2026.Abstract While the physical and mental health benefits of greenspace exposure are well documented, ethnic minority communities in the United Kingdom continue to engage with these environments at disproportionately lower rates. This persistent disparity points to an oversight in existing literature, specifically regarding how these communities navigate ...
Andrew K. Palmer +5 more
wiley +1 more source
Visualizing Quantum Circuit Probability: Estimating Quantum State Complexity for Quantum Program Synthesis. [PDF]
Entropy (Basel), 2023 Bach BG, Kundu A, Acharya T, Sarkar A.
europepmc +1 more source
Bivariate postprocessing of wind vectors
Quarterly Journal of the Royal Meteorological Society, EarlyView.We introduce three novel bivariate postprocessing approaches and analyze their performance for joint postprocessing of bivariate wind‐vector components in Germany. Bivariate vine‐copula‐based models, a bivariate gradient‐boosted version of ensemble model output statistics (EMOS), and a bivariate distributional regression network (DRN) are compared with
Ferdinand Buchner +3 more
wiley +1 more source
The Complexity of POMDPs with Long-run Average Objectives
, 2019 We study the problem of approximation of optimal values in partially-observable Markov decision processes (POMDPs) with long-run average objectives.
Chatterjee, Krishnendu +2 more
core +3 more sources
River Research and Applications, EarlyView.ABSTRACT Understanding how changes in catchment conditions affect ecohydrology in response to rainfall‐runoff events is crucial when developing informed strategies to enhance flow resilience, restore natural habitats, interpret water quality data or reduce flood risk.
Josie Ashe +7 more
wiley +1 more source
On the descriptional complexity of iterative arrays [PDF]
, 2003 The descriptional complexity of iterative arrays (lAs) is studied. Iterative arrays are a parallel computational model with a sequential processing of the input. It is shown that lAs when compared to deterministic finite automata or pushdown automata may
Malcher, Andreas
core
Path‐Based Deep Reinforcement Learning for On‐Board Routing in Satellite Constellation Networks
International Journal of Satellite Communications and Networking, EarlyView.ABSTRACT Efficient usage of available network resources is a crucial factor for broadband services in interconnected satellite constellations. To meet required quality of service standards under heavy network loads, it is essential to optimize traffic distribution among the intersatellite links. To address this challenge, we propose an adaptive traffic
Manuel M. H. Roth +4 more
wiley +1 more source