Results 71 to 80 of about 26,105 (190)
On the products of group vertex magic graphs
Let [Formula: see text] be a simple undirected graph and let A be an additive Abelian group with identity 0. A mapping [Formula: see text] is said to be a A-vertex magic labeling of G if there exists a μ in A such that [Formula: see text] for any vertex ...
S. Balamoorthy +2 more
doaj +1 more source
Classifying 50 years of Bell inequalities
Since John S. Bell demonstrated the interest of studying linear combinations of probabilities in relation with the EPR paradox in 1964, Bell inequalities have lead to numerous developments.
Bancal, Jean-Daniel +2 more
core +2 more sources
Guidance or Misdirection? Unpacking the Role of Feedback in Health Preference Assessments
ABSTRACT This study investigated the impact of providing feedback to respondents on a dominance‐structured choice task on subsequent choice behavior in a discrete choice experiment (DCE). The DCE was conducted among 626 patients with heart failure. Respondents were given a dominance‐structured choice task in which two devices (Device A and Device B ...
Mesfin G. Genie +2 more
wiley +1 more source
The team orienteering problem with variable time windows
Abstract The orienteering problem is well‐established within the domain of operational research. This paper introduces the team orienteering problem with variable time windows (TOPVTW) as a new variant of the team orienteering problem with time windows. The distinguishing feature of the TOPVTW is the adaptive time windows, which evolve dynamically as a
Bibiana Granda, Begoña Vitoriano
wiley +1 more source
Perfect state transfer, graph products and equitable partitions [PDF]
We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on variants of the double cones [BCMS09,ANOPRT10,ANOPRT09] and the Cartesian graph products (which includes the n ...
Ge, Yang +3 more
core
Functional Equations for Lexicographic Products
We generalize the main result of math.RA/9608214 concerning the convex embeddings of a chain Gamma in a lexicographic power Delta^Gamma. For a fixed nonempty chain Delta, we derive necessary and sufficient conditions for the existence of nonempty solutions Gamma to each of the lexicographic functional equations (Delta^Gamma)^{<=0} simeq Gamma ...
Kuhlmann, Franz--Viktor +2 more
openaire +2 more sources
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
Quantum Time‐Marching Algorithms for Solving Linear Transport Problems Including Boundary Conditions
ABSTRACT This article presents the first complete application of a quantum time‐marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The method adapts the linear combination of unitaries algorithm to block encode the diffusive dynamics, while ...
Sergio Bengoechea +2 more
wiley +1 more source
Das lexikographische Beispiel in der Parömiographie. Formen und Funktionen
The Lexicographic Example in Paremiography. Forms and Functions. This paper discusses the lexicographic example within the scope of paremiography (proverb lexicography).The focus is on criteria for the identification, determination and selection of ...
Vida Jesenšek
doaj +1 more source
Binary Binning: Examining the Mapping Between Continuous and Binary Review Scales
ABSTRACT Products and services are commonly rated on either a 5‐point scale or a binary scale. Using a pilot experiment, two between‐subjects experiments, and a survey, this paper investigates how individuals evaluate products differently depending on the scale used, how they categorize ratings on a 5‐point scale into binary bins, and how they estimate
Neel Ocean, Vasundhara, Rucha Paricharak
wiley +1 more source

