Results 71 to 80 of about 1,712 (186)

The Great Temporal Divide: How Top Management Team Temporal Faultlines and Dominant Subgroups Shape Firm Innovativeness in Iran

Journal of Management Studies, EarlyView.
Abstract While executives vary in attention to the past, present, and future, prior work has largely examined these temporal orientations in isolation or at the individual level, which limits insight into how they jointly configure within top management teams (TMTs) and translate into firm behaviours.
Shi Tang, Sherry M. B. Thatcher, Andreas W. Richter, Stephen X. Zhang, Asghar Afshar Jahanshahi   +4 more
wiley   +1 more source

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation [PDF]

, 2021
International audienceWe propose a solution approach for the problem (P) of minimizing an unconstrained binary polynomial optimization problem. We call this method PQCR (Polynomial Quadratic Convex Reformulation).
Lazare, Arnaud, Lambert, Amélie, Elloumi, Sourour   +2 more
core   +1 more source

Welfare implications of fair and accountable insurance pricing

Journal of Risk and Insurance, EarlyView.
Abstract This paper introduces an empirical framework to evaluate the welfare implications of fair and accountable insurance pricing by modeling the complete pricing process, including demand and price optimization. Moving beyond traditional cost modeling, we analyze both discrimination‐related fairness criteria and broader regulatory constraints, such
Fei Huang, Hajime Shimao
wiley   +1 more source

Continuous black-box optimization with an Ising machine and random subspace coding

Physical Review Research, 2022
A black-box optimization algorithm such as Bayesian optimization finds the extremum of an unknown function by alternating the inference of the underlying function and optimization of an acquisition function.
Syun Izawa, Koki Kitai, Shu Tanaka, Ryo Tamura, Koji Tsuda   +4 more
doaj   +1 more source

A novel dual‐decomposition method for non‐convex two‐stage stochastic mixed‐integer quadratically constrained quadratic problems

International Transactions in Operational Research, Volume 33, Issue 5, Page 3128-3157, September 2026.
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

Time‐Delayed Spiking Reservoir Computing Enables Efficient Time Series Prediction

Advanced Intelligent Systems, Volume 8, Issue 7, July 2026.
This study proposes time‐delayed spiking reservoir computing (TDSRC) for efficient time series prediction. By concatenating time‐lagged states, TDSRC constructs an expanded readout feature vector without altering internal reservoir dynamics. This approach enables highly accurate forecasting with significantly fewer neurons, providing a resource ...
Pin Jin, Ren Cao, Zhongxue Gan, Siyang Leng   +3 more
wiley   +1 more source

Harnessing Generative AI Within Human‐Aligned Constraints: Exploring Control Strategies and Existential Considerations

Engineering Reports, Volume 8, Issue 7, July 2026.
We propose the Powerful‐but‐Limited Generative AI theorem, demonstrating that embedding human‐inspired constraints, such as fixed utility functions and neuro‐symbolic submission layers, ensures generative AI remains controllable by preventing self‐improvement beyond designer intent.
Saeed Banaeian Far, Mohammad Reza Chalak Qazani, Falah Younis Hamode Hamod, Azadeh Imani Rad   +3 more
wiley   +1 more source

Efficient rank minimization to tighten semidefinite programming for unconstrained binary quadratic optimization [PDF]

2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017
We propose a method for low-rank semidefinite programming in application to the semidefinite relaxation of unconstrained binary quadratic problems. The method improves an existing solution of the semidefinite programming relaxation to achieve a lower rank solution.
Roman Pogodin, Mikhail Krechetov, Yury Maximov   +2 more
openaire   +2 more sources

Quadratic reformulations of nonlinear binary optimization problems [PDF]

, 2017
peer reviewedVery large nonlinear unconstrained binary optimization problems arise in a broad array of applications. Several exact or heuristic techniques have proved quite successful for solving many of these problems when the objective function is a
Anthony, Martin, Gruber, Aritanan, Crama, Yves, Boros, Endre   +3 more
core   +1 more source

Convolutional formulation of large-scale quadratic unconstrained binary optimization with dense interactions

Communications Physics
The spatial photonic Ising machine (SPIM) is a promising optical hardware solver for large-scale combinatorial optimization problems with dense interactions.
Hiroshi Yamashita, Hideyuki Suzuki
doaj   +1 more source