Results 51 to 60 of about 332,730 (283)
RWA: Optical Networks with Heuristics Algorithms
Dyna, 2016 The increase in demand for data transport through WDM (Wavelength Division Multiplexing) networks has led to the emerging problems related to finding routes and assigning wavelengths in these networks, which are solved through algorithmic processes ...
Arturo Benito Rodríguez Garcia +2 more
doaj +1 more source
Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm
IEEE Transactions on Quantum Engineering, 2022 The qubit-mapping problem aims to assign and route qubits of a quantum circuit onto an noisy intermediate-scale quantum (NISQ) device in an optimized fashion, with respect to some cost function.
Matthew A. Steinberg +4 more
doaj +1 more source
, 2019 It is challenging to design large and low-cost communication networks. In this paper, we formulate this challenge as the prize-collecting Steiner Tree Problem (PCSTP).
Brazil, Marcus +3 more
core +1 more source
Auto‐Routing Fluidic Printed Circuit Boards
Advanced Robotics Research, EarlyView.This work introduces (STREAM) software tool for routing efficiently advanced macrofluidics, an open‐source software tool for automating the design of 3D‐printable fluidic circuit boards. STREAM streamlines tube routing and layout, enabling the rapid fabrication of fluidic networks for soft robotics, lab‐on‐a‐chip devices, microfluidics, and biohybrid ...
Savita V. Kendre +3 more
wiley +1 more source
Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization [PDF]
, 2008 Many artificial intelligence (AI) problems naturally map to NP-hard optimization problems. This has the interesting consequence that enabling human-level capability in machines often requires systems that can handle formally intractable problems.
Macready, William G. +2 more
core
A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
, 2015 Fixed parameter tractable algorithms for bounded treewidth are known to exist for a wide class of graph optimization problems. While most research in this area has been focused on exact algorithms, it is hard to find decompositions of treewidth ...
CC Ribeiro +4 more
core +1 more source
Hard‐Magnetic Soft Millirobots in Underactuated Systems
Advanced Robotics Research, EarlyView.This review provides a comprehensive overview of hard‐magnetic soft millirobots in underactuated systems. It examines key advances in structural design, physics‐informed modeling, and control strategies, while highlighting the interplay among these domains.
Qiong Wang +4 more
wiley +1 more source
Flood susceptibility mapping using meta-heuristic algorithms
Geomatics, Natural Hazards & Risk, 2022 Flood is a common global natural hazard, and detailed flood susceptibility maps for specific watersheds are important for flood management measures. We compute the flood susceptibility map for the Kaiser watershed in Iran using machine learning models ...
Alireza Arabameri +7 more
doaj +1 more source
Heuristic algorithm for univariate stratification problem
RAIRO - Operations Research, 2023 In sampling theory, stratification corresponds to a technique used in surveys, which allows segmenting a population into homogeneous subpopulations (strata) to produce statistics with a higher level of precision. In particular, this article proposes a heuristic to solve the univariate stratification problem – widely studied in the literature.
José André Brito +3 more
openaire +3 more sources
Grounding Large Language Models for Robot Task Planning Using Closed‐Loop State Feedback
Advanced Robotics Research, EarlyView.BrainBody‐Large Language Model (LLM) introduces a hierarchical, feedback‐driven planning framework where two LLMs coordinate high‐level reasoning and low‐level control for robotic tasks. By grounding decisions in real‐time state feedback, it reduces hallucinations and improves task reliability.
Vineet Bhat +4 more
wiley +1 more source