Results 171 to 180 of about 26,022 (315)
Effectiveness of In‐Person Versus Online Negotiation Teaching for Practitioners
Most negotiation courses have been taught in person. However, online education has become more prevalent over the past decade due to its flexibility, cost and time efficiency, and new digital technologies designed to compensate for the lack of personal contact.
Patricia Oehlschläger, Michael A. Merz
wiley +1 more source
The Gelfand–Kirillov conjecture for semi-direct products of Lie algebras
Alfons I. Ooms
openalex +2 more sources
On algebraic Lie groups and algebr̀as [PDF]
openaire +3 more sources
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie +5 more
wiley +1 more source
On Some Infinite Dimensional Representations of Semi-Simple Lie Algebras [PDF]
Hiroshi Kimura
openalex +1 more source
On pooling‐based track fusion strategies: Harmonic mean density
Pooling strategies are viable techniques for distributed fusion since they do not require ‘extra’ information from local nodes. Harmonic mean density fusion is an attractive method among pooling strategies as it can fuse both Gaussian and Gaussian mixture densities easily.
Nikhil Sharma +3 more
wiley +1 more source
Reviewing fast or slow: A theory of summary reversal in the judicial hierarchy
Abstract Appellate courts with discretionary dockets have multiple ways to review lower courts. We develop a formal model that evaluates the trade‐offs between “full review”—which features full briefing, oral arguments, and signed opinions—versus “quick review,” where a higher court can summarily reverse a lower court. We show that having the option of
Alexander V. Hirsch +2 more
wiley +1 more source
On the diversity of test instances for studying branch‐and‐bound performance
Summary In their paper ‘An Automatic Method for Solving Discrete Programming Problems’, Ailsa Land and Alison Doig developed a branch‐and‐bound method for solving the general case of the mixed integer linear programming (MIP) problem. A core part of the algorithm, branch variable selection, has received renewed attention in recent years with the ...
Simon Bowly, Kate Smith‐Miles
wiley +1 more source
Canonicalizing Zeta Generators: Genus Zero and Genus One. [PDF]
Dorigoni D +7 more
europepmc +1 more source
Two-Variable Identities in Groups and Lie Algebras [PDF]
Fritz Grunewald +3 more
openalex +1 more source

