Results 111 to 120 of about 411 (241)
Using Randomized Nyström Preconditioners to Accelerate Variational Image Reconstruction. [PDF]
Hong T, Xu Z, Hu J, Fessler JA.
europepmc +1 more source
Cross-points in the Dirichlet-Neumann method I: well-posedness and convergence issues. [PDF]
Chaudet-Dumas B, Gander MJ.
europepmc +1 more source
The Dynamics of Legitimacy in Integrative Bargaining Over Restructuring
ABSTRACT This paper demonstrates the dynamics of legitimacy in integrative bargaining over restructuring. Through a case study of SteelCo, we show that cognitive legitimacy is essential to the identification of integrative potential, which interacts with pragmatic and moral legitimacy as bargaining evolves.
Christopher J. McLachlan +2 more
wiley +1 more source
All-at-once multigrid approaches for one-dimensional space-fractional diffusion equations. [PDF]
Donatelli M +3 more
europepmc +1 more source
ABSTRACT The recent rise of Generative Artificial Intelligence (GenAI) is fundamentally changing the way businesses operate, with many now investing heavily in this technology. However, businesses are still exploring ways to extract value from GenAI and develop organisational capabilities.
Ashish Jagdish Sharma +4 more
wiley +1 more source
Fast PET reconstruction with variance reduction and prior-aware preconditioning. [PDF]
Ehrhardt MJ, Kereta Z, Schramm G.
europepmc +1 more source
Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley +1 more source
Efficient preconditioning strategies for accelerating GMRES in block-structured nonlinear systems for image deblurring. [PDF]
Khalid R +4 more
europepmc +1 more source
A link between the steepest descent method and fixed-point iterations. [PDF]
Heid P.
europepmc +1 more source
Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source

