Results 131 to 140 of about 163,989 (311)
The Query Complexity of Graph Isomorphism: Bypassing Distribution Testing Lower Bounds
Presented on March 12, 2018 at 11:00 a.m. in the Klaus Advanced Computing Building, Room 1116E.Xiaorui Sun is a postdoctoral researcher at Microsoft Research Redmond.
Sun, Xiaorui
core
The knapsack problem is an optimization problem in computer science which involves determining the most valuable combination of items that can be packed into a knapsack (a container) with a limited capacity (weight or volume); the goal is to maximize the total profit of the items included in the knapsack without exceeding its capacity.This study ...
Bin Usman, Bashar +4 more
openaire +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
3D Printed Photon Shield Assembly for Low‐Noise Visual Stimulation During Two‐Photon Imaging in Mice
We present the Photon Shield, an open‐hardware system for low‐noise two‐photon calcium imaging during visual stimulation in mice. Combining a 3D‐printed headplate and rail‐mounted shield substantially reduces stray‐light contamination, as quantitatively verified. Functional validation confirms reliable cortical responses. Open design files enable broad
Gergely Katona +6 more
wiley +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
Scalable Task Planning via Large Language Models and Structured World Representations
This work efficiently combines graph‐based world representations with the commonsense knowledge in Large Language Models to enhance planning techniques for the large‐scale environments that modern robots will need to face. Planning methods often struggle with computational intractability when solving task‐level problems in large‐scale environments ...
Rodrigo Pérez‐Dattari +4 more
wiley +1 more source
Search Algorithms for Satisfiability Problems in Combinational Switching Circuits
A number of tasks in computer-aided analysis of combinational circuits, including test pattern generation, timing analysis, delay fault testing and logic verification, can be viewed as particular formulations of the satisfiability problem (SAT).
João Paulo Marques da Silva +2 more
core
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
Anytime Algorithms for ROBDD Symmetry Detection and Approximation [PDF]
Reduced Ordered Binary Decision Diagrams (ROBDDs) provide a dense and memory efficient representation of Boolean functions. When ROBDDs are applied in logic synthesis, the problem arises of detecting both classical and generalised symmetries.
Kettle, Neil
core
The high complexity of numerous optimal classic communication schemes, such as the maximum likelihood (ML) multiuser detector (MUD), often prevents their practical implementation.
Botsinis, Panagiotis +5 more
core +1 more source

