Results 91 to 100 of about 369,293 (294)

Computational Complexity of Weighted Threshold Games

open access: yes, 2007
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its weights exceeds a given threshold.
Elkind, Edith   +3 more
core   +1 more source

The complexity of class TAUTOLOGY-NP

open access: yes, 2018
P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP?
Frank Vega (4690180)
core   +1 more source

A Knowledge‐Based Approach for Understanding and Managing Additive Manufacturing Data

open access: yesAdvanced Engineering Materials, EarlyView.
Additive manufacturing processes generate a large amount of data. Effectively managing, understanding, and retrieving information from this data remains a major challenge. Therefore, we propose an ontology‐based approach to integrate heterogeneous data, enable semantic queries, and support decision‐making.
Mina Abd Nikooie Pour   +5 more
wiley   +1 more source

OntOMat: Toward Ontology‐Based Product and Process Design Engineering and Optimization Solutions Fueling Circular Value Chains

open access: yesAdvanced Engineering Materials, EarlyView.
The OntOMat ontology establishes a structured framework for polymer matrix fiber reinforced composite materials, integrating manufacturing processes, characterization methods, and multiscale design through the VDI/VDE 3682 formalized process description standard.
Nicolas Christ   +19 more
wiley   +1 more source

Leveraging Symbolic Artificial Intelligence and Fuzzy Logic for Materials Science: A Review of Methods, Challenges, and Applications to Scarce and Imperfect Experimental Data

open access: yesAdvanced Engineering Materials, EarlyView.
This article explores the transformative potential of symbolic artificial intelligence (AI) in the field of materials science, particularly in leveraging experimental data. The article presents several symbolic AI models and discusses their applications in materials science.
Ahmed Amrani   +7 more
wiley   +1 more source

Printed Integrated Logic Circuits Based on Chitosan‐Gated Organic Transistors for Future Edible Systems

open access: yesAdvanced Functional Materials, EarlyView.
Edible electronics needs integrated logic circuits for computation and control. This work presents a potentially edible printed chitosan‐gated transistor with a design optimized for integration in circuits. Its implementation in integrated logic gates and circuits operating at low voltage (0.7 V) is demonstrated, as well as the compatibility with an ...
Giulia Coco   +8 more
wiley   +1 more source

Computing quantum discord is NP-complete

open access: yesNew Journal of Physics, 2014
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete.
Yichen Huang
doaj   +1 more source

Using interactive visualization for teaching the theory of NP-completeness [PDF]

open access: yes, 2007
In this paper we investigate the potential of interactive visualization for teaching the theory of NP-completeness to undergraduate students of computer science.
Pape, Christian
core   +1 more source

Counterion Dependent Side‐Chain Relaxation Stiffens a Chemically Doped Thienothiophene Copolymer

open access: yesAdvanced Functional Materials, EarlyView.
Oxidation of a thienothiophene copolymer, p(g3TT‐T2), via different doping strategies and dopant molecules resulted in materials with similar oxidation levels and a high electrical conductivity of ≈100 S cm−1. However, mechanical properties varied significantly, with sub‐glass transition temperatures and elastic moduli spanning from –44°C to –3°C and ...
Mariavittoria Craighero   +12 more
wiley   +1 more source

An Alternative proof of SAT NP-Completeness

open access: yes, 2004
We give a proof of SAT's NP-completeness based upon a syntaxic characterization of NP given by Fagin at 1974. Then, we illustrate a part of our proof by giving examples of how two well-known problems, MAX INDEPENDENT SET and 3- COLORING, can be expressed
Escoffier, Bruno, Paschos, Vangelis, Th.
core   +2 more sources

Home - About - Disclaimer - Privacy