Results 91 to 100 of about 3,203 (298)
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
Service oriented transitive closure solution [PDF]
, 2008 The goal of this project is a service based solution that utilizes parallel and distributed processing algorithms to solve the transitive closure problem for a large dataset.
Baran, Jonathan
core +1 more source
Systems Research and Behavioral Science, EarlyView.ABSTRACT This paper presents an innovative integration of structured democratic dialogue with a multi‐criteria evaluation step designed to strengthen participatory decision‐making for complex socio‐ecological challenges. Conducted virtually with Communities of Practice focused on multi‐species governance, the process combined systemic mapping of ...
Yiannis Laouris +8 more
wiley +1 more source
A Bird's Eye View of English Grammar: Connecting the Dots in Two Dimensions
TESOL Quarterly, EarlyView.Abstract Over the past few decades, discussions on grammar instruction have primarily focused on teaching methodologies, such as whether grammar should be taught explicitly or implicitly, and whether the focus should be on form or forms. This paper, however, shifts the focus to grammar itself, aiming to provide a “shape” for pedagogical grammar.
Akira Tajino, Yoshitaka Kato
wiley +1 more source
Journal of Animal Ecology, EarlyView.This study combines replicated experimental manipulation, social network analysis, network permutations and meta‐analysis to disentangle active from spatially‐induced changes in animal network structure in the wild. It reveals that short‐term environmental changes primarily alter space use, with limited effects on social structure.
Camille N. M. Bordes +6 more
wiley +1 more source
AlgorithmsFloyd–Warshall’s algorithm is a widely-known procedure for computing all-pairs shortest paths in a graph of n vertices in Θ(n3) time complexity. A simplified version of the same algorithm computes the transitive closure of the graph with the same time ...
Giuseppe Lancia, Marcello Dalpasso
doaj +1 more source
Construction of Transitive Closure of Binary Multirelations [PDF]
, 2009 Binary multirelations have received attention in recent years as a semantic domain of nondeterministic programming languages. Also, it is known that binary multirelations provide a model of Parikh’s game logic. The iteration operator plays a central role
core
Parallel naive and semi-naive transitive closure evaluation [PDF]
, 1993 Transitive closure operation is an important extension to relational algebra. The two most well-known methods to compute transitive closure are naive and semi-naive approaches. We give the optimal parallel versions of these two algorithms by using double-
Orlowska, M. E., Zhou, Xiaofang
core +1 more source
British Journal of Management, EarlyView.Abstract The call for transformation in Management Education (ME) has intensified amid global crises, including the climate emergency, social inequality, and recurrent corporate misconduct. While Responsible Management Education (RME) has emerged in response to these challenges, it often struggles to move beyond symbolic gestures towards substantive ...
Janette Brunstein +2 more
wiley +1 more source
An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a proximity [PDF]
, 2008 A method to get the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is presented.
González, Ramón +2 more
core +2 more sources