Results 101 to 110 of about 163,261 (288)
Granularity for Mixed-Integer Polynomial Optimization Problems
Abstract Finding good feasible points is crucial in mixed-integer programming. For this purpose we combine a sufficient condition for consistency, called granularity, with the moment-/sum-of-squares-hierarchy from polynomial optimization. If the mixed-integer problem is granular, we obtain feasible points by solving continuous polynomial ...
Carl Eggen +2 more
openaire +2 more sources
Quantization‐aware training creates resource‐efficient structured state space sequential S4(D) models for ultra‐long sequence processing in edge AI hardware. Including quantization during training leads to efficiency gains compared to pure post‐training quantization.
Sebastian Siegel +5 more
wiley +1 more source
We analyzed a special class of graph traversal problems, where the distances are stochastic, and the agent is restricted to take a limited range in one go.
Tamás Kegyes +3 more
doaj +1 more source
A Convex Optimization Algorithm for Electricity Pricing of Charging Stations
The problem of electricity pricing for charging stations is a multi-objective mixed integer nonlinear programming. Existing algorithms have low efficiency in solving this problem.
Jing Zhang +7 more
doaj +1 more source
This study provides an introduction to Bayesian optimisation targeted for experimentalists. It explains core concepts, surrogate modelling, and acquisition strategies, and addresses common real‐world challenges such as noise, constraints, mixed variables, scalability, and automation.
Chuan He +2 more
wiley +1 more source
A multi-step mixed integer programming heuristic for warehouse layout optimization
Warehouse layout optimization is critical to inventory and logistics management in organizations. In many instances, limited warehouse space is a constraint and a barrier to expanding operations and increasing demand.
Sanjaya Mayadunne +2 more
doaj +1 more source
TacEva: A Performance Evaluation Framework for Vision‐Based Tactile Sensors
This work introduces TacEva, a unified framework for evaluating vision‐based tactile sensors. It standardizes intrinsic, performance, and robustness metrics through shared experimental procedures and links them to task‐level requirements in robotic manipulation.
Qingzheng Cong +5 more
wiley +1 more source
Engineering optimization problems usually contain various constraints and mixed integer-discrete-continuous types of design variables. We propose an efficient particle swarm optimization (PSO) algorithm for such problems.
Semin Chun +2 more
doaj +1 more source
Generalized Maximum Entropy estimation of discrete sequential move games of perfect information [PDF]
We propose a data-constrained generalized maximum entropy (GME) estimator for discrete sequential move games of perfect information which can be easily implemented on optimization software with high-level interfaces such as GAMS.
Graham, Brett, Wang, Yafeng
core +1 more source
ABSTRACT In order to reflect the actual production situation more comprehensively and optimize the production cost, this paper solves the short‐term scheduling optimization problem for a single pipeline containing high melting point crude oil. Based on the refining plan given by the upper layer, a multi‐objective optimization model with high melting ...
Jing Yao +5 more
wiley +1 more source

