Results 81 to 90 of about 133,463 (288)
On binary decision hypertree (hyperdiagram) [PDF]
In computer science, a binary decision diagram is a data structure that is used to represent a Boolean function and to consider a compressed representation of relations.
Mohammad Hamidi, Marzieh Rahmati
doaj +1 more source
A quasi‐periodic Dart‐Kite (QDK) metastructure with a golden‐ratio‐constrained strong–weak bond network simultaneously enhances strength, toughness, and damage tolerance. Its distributed topology enables predictable, tailorable crack paths for precise fracture control and stable mechanics, demonstrating a high‐performance, controllable architecture ...
Tianyu Gao +3 more
wiley +1 more source
A Boolean network control algorithm guided by forward dynamic programming.
Control problem in a biological system is the problem of finding an interventional policy for changing the state of the biological system from an undesirable state, e.g. disease, into a desirable healthy state.
Mohammad Moradi +2 more
doaj +1 more source
Quantum programming of the satisfiability problem with Rydberg atom graphs
Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here we propose and experimentally demonstrate a Rydberg atom approach to program the
Seokho Jeong +4 more
doaj +1 more source
Memristive Physical Reservoir Computing
Memristors’ nonlinear dynamics and input‐dependent memory effects make them ideal candidates for high‐performance physical reservoir computing (RC). Based on their conductance modulation, memristors can be classified as electronic or optoelectronic types.
Dian Jiao +9 more
wiley +1 more source
We present an exact synthesis approach for computing Exclusive-or Sum-of-Products (ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our approach finds one or more ESOP forms for a given Boolean function.
De Micheli, Giovanni +3 more
core +1 more source
Quantitative Information Flow in Boolean Programs [PDF]
The quantitative information flow bounding problem asks, given a program P and threshold q, whether the information leaked by P is bounded by q. When the amount of information is measured using mutual information, the problem is known to be PSPACE-hard and decidable in EXPTIME.
Rohit Chadha +2 more
openaire +1 more source
Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source
Programming Quantum Computers Using Design Automation
Recent developments in quantum hardware indicate that systems featuring more than 50 physical qubits are within reach. At this scale, classical simulation will no longer be feasible and there is a possibility that such quantum devices may outperform even
Häner, Thomas +2 more
core +1 more source
The Role of Artificial Intelligence in Medication Management for Older Adults: A Systematic Review
Artificial intelligence enhances medication management for older adults by improving adherence, personalizing treatment, and predicting risks. Despite benefits, challenges remain in usability, trust, ethics, and system integration. Successful adoption requires user‐centered design, ethical safeguards, and seamless healthcare integration to ensure safe,
Dipak Chandra Das +9 more
wiley +1 more source

