Results 91 to 100 of about 6,692,580 (276)
Quantum enumeration approaches to solving the shortest vector problem
The Shortest Vector Problem (SVP) is a fundamental computational problem believed to be hard for both classical and quantum computers. Its hardness underpins security of lattice-based cryptographic (LBC) schemes, a leading class of post-quantum ...
Prokop, Miloš
core +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
Multi-population genetic algorithms with immigrants scheme for dynamic shortest path routing problems in mobile ad hoc networks [PDF]
Copyright @ Springer-Verlag Berlin Heidelberg 2010.The static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc ...
Yang, S +5 more
core +1 more source
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
A codesign multiobjective optimization framework was developed to enhance the morphology and controller of a snake‐like robot driven by artificial muscles. It improved planar locomotion, agility, and power efficiency. The approach optimized link geometry and controller gains, revealing that shorter muscles near joints and longer linkages maximize ...
Ayla Valles, Mahdi Haghshenas‐Jaryani
wiley +1 more source
A bit-arc capacity scaling algorithm for the maximum flow problem subjected to box constraints on the flow vector in digraph [PDF]
A bit-arc capacity scaling algorithm to solve the maximal flow problem subjected to box constraints on the flow vector in directed network has been presented. The algorithm is mainly based on successive divisions of capacities by multiples of two.
Muhammad Tlas
doaj
The solution of the majority of the practical tasks arising at calculation of constructions demands a numerical solution of boundary value problems. In article on examples of a solution of specific boundary value problems possibilities of a modern object-
Vladimir L. Mondrus, Dmitry K. Sizov
doaj +1 more source
K shortest paths in stochastic time-dependent networks [PDF]
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent.
Andersen, Kim Allan +2 more
core
Information Transmission Strategies for Self‐Organized Robotic Aggregation
In this review, we discuss how information transmission influences the neighbor‐based self‐organized aggregation of swarm robots. We focus specifically on local interactions regarding information transfer and categorize previous studies based on the functions of the information exchanged.
Shu Leng +5 more
wiley +1 more source
Twin Bounded Large Margin Distribution Classifier Based on Unified Pinball Loss
Twin Support Vector Machine (TSVM) decomposes the optimization problem of the traditional Support Vector Machine (SVM) into two smaller optimization problems, which greatly improves the computing efficiency without reducing the classification performance.
Pingping Gu +3 more
doaj +1 more source

