Results 181 to 190 of about 2,188,345 (345)

Optimal oblivious routing in polynomial time

Symposium on the Theory of Computing, 2003
Y. Azar, Edith Cohen, A. Fiat, Haim Kaplan, Harald Räcke   +4 more
semanticscholar   +1 more source

Data‐Driven Design of Bimodal Networked Dielectric Elastomers for High‐Performance Artificial Muscles

Advanced Intelligent Systems, EarlyView.
A data‐efficient artificial intelligence‐assisted framework, which integrates experimental data with machine learning, is developed for the design of bimodal networked dielectric elastomers (DEs) as advanced artificial muscles. It adopts neural networks to predict DEs’ mechanical properties and support vector machines to classify electromechanical ...
Ofoq Normahmedov, Hanzhi Ma, Junbo Peng, Huifeng Dong, Jiangshan Zhuo, Mengke Shi, Lvting Wang, Shengchao Jiang, Ye Shi   +8 more
wiley   +1 more source

Dollo-CDP: a polynomial-time algorithm for the clade-constrained large Dollo parsimony problem. [PDF]

Algorithms Mol Biol
Dai J, Rubel T, Han Y, Molloy EK.
europepmc   +1 more source

Optimizing 3D Bin Packing of Heterogeneous Objects Using Continuous Transformations in SE(3)

Advanced Intelligent Systems, EarlyView.
This article presents a method for solving the three‐dimensional bin packing problem for heterogeneous objects using continuous rigid‐body transformations in SE(3). A heuristic optimization framework combines signed‐distance functions, neural network approximations, point‐cloud bin modeling, and physics simulation to ensure feasibility and stability ...
Michele Angelini, Marco Carricato
wiley   +1 more source

Hardware acceleration of number theoretic transform for zk‐SNARK

Engineering Reports, EarlyView., 2023
An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao, Dong Ding, Feng Wang, Pengcheng Hua, Ning Wang, Qin Wu, Zhilei Chai   +6 more
wiley   +1 more source

A polynomial-time algorithm for computing absolutely normal numbers

Information and Computation, 2013
V. Becher, P. Heiber, T. Slaman
semanticscholar   +1 more source

In‐Memory Continuous‐Time SAT Solver Based on Bidirectional 11‐T SRAM Macro

Advanced Intelligent Systems, EarlyView.
This article reported a continuous‐time (CT) Boolean satisfiability (SAT) problem solver using bidirectional 11T‐SRAM macro. The proposed system operates asynchronously using capacitor‐based gradient integration and maximizes the parallelism for SAT solving by in‐memory computing (IMC).
Dongseok Kwon, Tinish Bhattacharya, George Higgins Hutchinson, Dmitri Strukov   +3 more
wiley   +1 more source

A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-Criteria Optimization

, 2008
. We propose a polynomial-time-delay polynomial-space algorithm to enumerate all efficient extreme solutions of a multi-criteria minimum-cost spanning tree problem, while only the bi-criteria case was studied in the literature.
Takeaki Uno, Yoshio Okamoto
core  

Stable Neural Signal Recording Processed by Memristor‐Based Reservoir Computing System

Advanced Intelligent Systems, EarlyView.
This work introduces a memristor‐based reservoir computing (RC) system for real‐time, energy‐efficient processing of neural signals in brain‐machine interface (BMI). Combined with flexible mesh neural probes with tissue‐like flexibility and subcellular‐scale features that enable consistent, long‐term tracking of single‐cell neural activities, the ...
Soohyeon Kim, Yuting Wu, Finn Moore, Mingtao Hu, Xiaoyu Zhang, Sangmin Yoo, Eric Yeu‐Jer Lee, Hao Shen, Yichun He, Jia Liu, Wei D. Lu   +10 more
wiley   +1 more source

List 3-coloring on comb-convex and caterpillar-convex bipartite graphs. [PDF]

J Comb Optim
Şen BB, Erlebach T, Yaşar Ö.
europepmc   +1 more source