Results 91 to 100 of about 7,335,515 (304)
Farmer Ants Optimization Algorithm: A Novel Metaheuristic for Solving Discrete Optimization Problems
Currently, certain complex issues are classified as NP-hard problems, for which there is no exact solution, or they cannot be solved in a reasonable amount of time. As a result, metaheuristic algorithms have been developed as an alternative.
Ali Asghari +4 more
doaj +1 more source
Seamless Mechanical Programming Through Hybrid Epoxy–Acrylate Printing for Soft–Rigid Robots
Hybrid epoxy‐acrylate printing enables seamless fabrication of soft–rigid robotic systems with covalently integrated interfaces and functionally graded mechanics. Grayscale exposure expands the accessible material space, enabling spatially programmed actuation through patterned stiffness while revealing the mechanics and durability of continuously ...
David C. Bershadsky +3 more
wiley +1 more source
Solving Impulsive Control Problems by Discrete-Time Dynamic Optimization Methods
This work presents an open-loop discrete-time dynamic optimization scheme for continuous-variable impulsive control problems. This methodology can be more useful than the classical optimal control in several contexts, since it delivers control actions ...
R.T.N. Cardoso, R.H.C. Takahashi
doaj +1 more source
Discrete optimization with polynomially detectable boundaries and restricted level sets
The paper describes an optimization procedure for a class of discrete optimization problems which is defined by certain properties of the boundary of the feasible region and level sets of the objective function.
Zinder, Y, Singh, G, Memar, J
core +1 more source
Advances in Bio‐Integrated Edge Computing Systems for Smart and Connected Health
This review explores advances in bio‐integrated edge computing for healthcare, focusing on co‐designing computing, sensing, and energy strategies to overcome integration and power challenges for optimized, decentralized operation. ABSTRACT Recent advances in bio‐integrated healthcare technologies have enabled continuous, high‐resolution monitoring and ...
Gyuwon Kim +4 more
wiley +1 more source
An Enhanced Discrete Bees Algorithm for Resource Constrained Optimization Problems
In this paper, we propose a novel efficient model based on Bees Algorithm (BA) for the Resource-Constrained Project Scheduling Problem (RCPSP). The studied RCPSP is a NP-hard combinatorial optimization problem which involves resource, precedence, and ...
Mohamed Amine Nemmich +2 more
doaj +1 more source
High‐aspect‐ratio low‐melting‐point alloy inclusions are embedded within multilayer silicone laminates to create thermally programmable stiffness. Sequential activation of alloy‐rich layers produces four distinct mechanical states and reconfigures tendon‐driven actuator trajectories under the same load.
Palpolage Don Shehan Hiroshan Gunawardane +4 more
wiley +1 more source
Strong Equivalence of Qualitative Optimization Problems [PDF]
We introduce the framework of qualitative optimization problems (or, simply, optimization problems) to represent preference theories. The formalism uses separate modules to describe the space of outcomes to be compared (the generator) and the preferences
Stefan Woltran +5 more
core +2 more sources
Dense tactile streams from across the humanoid body converge on collide in a central wiring and data bottleneck. By relocating computation closer to and then into the skin itself, near‐ and in‐sensor architectures, together with neuromorphic computing, chart a path toward perception‐native electronic skin, in which the conversion of stimulus into ...
Mijin Kim +6 more
wiley +1 more source
State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems
A simulated annealing (SA) algorithm is an effective method for solving optimization problems, especially for combinatorial optimization problems. However, SA algorithms rely heavily on the iterative mechanism of the neighborhood structure.
Xiaoxia Han +3 more
doaj +1 more source

