Results 71 to 80 of about 72,730 (310)
Continuum Mechanics Modeling of Flexible Spring Joints in Surgical Robots
A new mechanical model of a tendon‐actuated helical extension spring joint in surgical robots is built using Cosserat rod theory. The model can implicitly handle the unknown contacts between adjacent coils and numerically predict spring shapes from straight to significantly bent under actuation forces.
Botian Sun +3 more
wiley +1 more source
In this paper, we studied a multiobjective linear fractional programming (MOLFP) problem with pentagonal and hexagonal fuzzy numbers, while the decision variables are binary integer numbers.
Adane Akate, Getaye Fentaw
doaj +1 more source
Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling
A simulation‐driven framework for autonomous bulldozer leveling is presented, combining high‐fidelity terramechanics simulation with a neural‐network‐based reduced‐order model. Gradient‐based optimization enables efficient, low‐level blade control that balances leveling quality and operation time.
Harry Zhang +5 more
wiley +1 more source
MIPCL LIBRARY FOR SOLVING MIXED INTEGER PROGRAMMING PROBLEMS
The Mixed Integer Programming Class Library (MIPCL) is a free software designed for implementing mixed integer programming models quickly, easily, and efficiently. Computational experiments show that currently MIPCL is one of the best noncommercial mixed-
N. N. Pisaruk
doaj
Efficient election campaign optimization using integer programming
Purpose: Political parties spend significant amounts of resources during their election campaigns, which are usually designed in a sub-optimal and informal way.
Evren Güney
doaj +1 more source
A primal (all-integer) integer programming algorithm
The algorithm is most closely related to three existing procedures: the simplex method of G. B. Dantzig for linear programming problems, the Gomory all-integer integer programming algorithm, and the direct algorithm for integer programming of Ben-Israel ...
Young, Richard D.
core +1 more source
On Integer Programming and Convolution.
Integer programs with a constant number of constraints are solvable in pseudo-polynomial time. We give a new algorithm with a better pseudo-polynomial running time than previous results. Moreover, we establish a strong connection to the problem (min, +)-convolution. (min, +)-convolution has a trivial quadratic time algorithm and it has been conjectured
Klaus Jansen, Lars Rohwedder
openaire +4 more sources
On the bounded integer programming [PDF]
The best upper time bound for solving the bounded integer programming (BIP) up to now is poly(phi) ldr n2n+o(n), where n and phi are the dimension and the input size of the problem respectively. In this paper, we show that BIP is solvable in deterministic time poly(phi) ldr nn+o(n).
openaire +1 more source
Consensus Formation and Change are Enhanced by Neutrality
Neutral agents are shown to enhance both the formation and overturning of consensus in collective decision‐making. A general mathematical model and experiments with locusts and humans reveal that neutrality enables robust consensus via simple interactions and accelerates consensus change by reducing effective population size.
Andrei Sontag +3 more
wiley +1 more source
Helix Alignment, Chevrons, and Edge Dislocations in Twist‐Bend Ferroelectric Nematics
The recently discovered twist‐bend ferroelectric nematic (NTBF) is the new member of the multiferroic family, representing a fluid with an oblique helicoidal (heliconical) periodic structure of spontaneous electric polarization. The work presents a thorough exploration of the material properties of this phase, how the periodic modulation of ...
Bijaya Basnet +8 more
wiley +1 more source

