Results 61 to 70 of about 49,138 (261)
Advanced Materials, EarlyView.AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
Stochasticity in Algorithmic Statistics for Polynomial Time.
Electron. Colloquium Comput. Complex., 2017 A fundamental notion in Algorithmic Statistics is that of a stochastic object, i.e., an object having a simple plausible explanation. Informally, a probability distribution is a plausible explanation for x if it looks likely that x was drawn at random with respect to that distribution.
Alexey Milovanov +1 more
openaire +4 more sources
Navigating Lipid Nanostructure Design Space Through Continuous Microfluidic Automation
Advanced Materials, EarlyView.LipidXplorer is a novel microfluidic platform which enables rapid navigation of lipid particle design space for high‐resolution phase mapping, lipid nanoparticle optimization, membrane biophysics, and functional nanomaterial discovery. It combines programmable composition control, continuous nanoparticle formation, and automated well‐plate collection ...
Bradley Diggines +10 more
wiley +1 more source
A polynomial-time parsing algorithm for TT-MCTAG [PDF]
Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - ACL-IJCNLP '09, 2009 This paper investigates the class of Tree-Tuple MCTAG with Shared Nodes, TT-MCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language processing, in particular for dealing with discontinuities and word order variation in languages such as German.
KALLMEYER L, SATTA, GIORGIO
openaire +3 more sources
Advanced Materials, EarlyView.We present elastomeric three‐dimensional (3D) microstructures fabricated via two‐photon polymerization (2PP) and post‐processed through wet etching, for quantifying nanonewton (nN)‐scale forces applied by healthy and diseased neural cells. The mechanically characterized free‐standing beam architectures enable measurement of traction forces of ...
Pieter F. J. van Altena +7 more
wiley +1 more source
Polynomial time algorithm for solving k-coverage problem in wireless sensor networks
Dianxin kexue, 2017 How to solve the k-coverage problem,which was divided into worst-case and best-case,inside the two-dimensional target area in wireless sensor networks was explored,and a polynomial time algorithm for solving this problem was put forward.In this algorithm,
Qi WANG, Zheng’an XIAO, Huaixing WANG
doaj +2 more sources
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Journal of Graph Algorithms and Applications, 2007 Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games.
Louigi Addario-Berry +2 more
doaj +1 more source
Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free mu-calculus and ECTL* model checking problems. These classes can be solved in polynomial time using dedicated algorithms.
Maciej Gazda, Tim A.C. Willemse
doaj +1 more source
Advanced Robotics Research, EarlyView.Pak Biawak, a necrobot, embodies an unusual fusion of biology and robotics. Designed to repurpose natural structures after death, it challenges conventional boundaries between nature and engineering. Its movements are precise yet unsettling, raising questions about sustainability, ethics, and the untapped potential of biointegrated machines.
Leo Foulds +2 more
wiley +1 more source
The Subset Sum Problem: Reducing Time Complexity of NP-Completeness with Quantum Search
Undergraduate Journal of Mathematical Modeling: One + Two, 2012 The Subset Sum Problem is a member of the NP-complete class, so no known polynomial time algorithm exists for it. Although there are polynomial time approximations and heuristics, these are not always acceptable, yet exact-solution algorithms are ...
Bo Moon
doaj +1 more source