Results 131 to 140 of about 2,673,740 (200)
When queueing is better than push and shove [PDF]
We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms.
Schweinzer, Paul, Gershkov, Alex
core
Clusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
Computer Graphics Forum, EarlyView.Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci +6 more
wiley +1 more source
The Right to Stand and the Democratic Value of Elections
Constellations, EarlyView.
Annabelle Lever
wiley +1 more source
Differentiable Randers‐Finsler Eikonal Solvers
Computer Graphics Forum, EarlyView.Abstract Fast and differentiable solvers for anisotropic and asymmetric distance fields are a key primitive in geometry processing, enabling gradient‐based optimization over metrics, drift fields, and downstream objectives that depend on geodesic distances and geodesics.
Barak Gahtan +2 more
wiley +1 more source
A numerical approach to cyclic-service queueing models [PDF]
Queueing Theory;operations ...
Blanc, J.P.C.
core
Scalable Computation of Topological Abstractions for Scalar Data
Computer Graphics Forum, EarlyView.Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will +6 more
wiley +1 more source
A practical algorithm for weighted k‐hulls
Computer Graphics Forum, EarlyView.Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley +1 more source
Children &Society, EarlyView.ABSTRACT Over the past 15 years, the UK government has implemented significant welfare reforms. This paper reports a rapid review of qualitative data about the impact of the benefit cap and two‐child limit on children and young people's health and wellbeing. Four peer‐reviewed journal articles and 21 grey literature sources were included.
Hannah Fairbrother +4 more
wiley +1 more source
Sojourn time approximations in two-node queueing networks
, 2004 We develop a method for approximating sojourn time distributions in open queueing networks. The work is motivated by the performance analysis of distributed information systems, where transactions are handled by iterative server and database actions.
Resing, J.A.C. +3 more
core
Gender, Work &Organization, EarlyView.ABSTRACT This study examines how recurrent coastal flooding reshapes gendered vulnerabilities and capabilities in two communities in Pekalongan City, Indonesia. Drawing on in‐depth interviews, focus‐group discussions, and observations, the analysis applies an integrated framework of vulnerabilities and capabilities to investigate changes in livelihoods,
Isnan Fauzi +2 more
wiley +1 more source