Results 111 to 120 of about 23,608 (225)
Nutritional Value Evaluation of Fengjing Pig and Its F1 Hybrid Generation
Shipin gongye ke-jiTo evaluate the nutritional value of Fengjing pigs (FJ) and their F1 hybrid generation, FJ, Duroc (American)×Fengjing pigs (DAF), Duroc (Norwegian)×Fengjing pigs (DNF), Pietrain×Fengjing pigs (PF) and Duroc×Landrace×Yorkshire pigs (DLY) were studied ...
Jiajie ZHANG +9 more
doaj +1 more source
A Quantum Computational Learning Algorithm
, 1998 An interesting classical result due to Jackson allows polynomial-time learning of the function class DNF using membership queries. Since in most practical learning situations access to a membership oracle is unrealistic, this paper explores the ...
Martinez, Tony, Ventura, Dan
core +2 more sources
Exploring their Dark Side or death before DNF: Ultra-athletes' motivation to compete in and complete ultra-distance races [PDF]
, 2021 Kate Spenceley
openalex +1 more source
CNFs and DNFs with Exactly $k$ Solutions
Model counting is a fundamental problem that consists of determining the number of satisfying assignments for a given Boolean formula. The weighted variant, which computes the weighted sum of satisfying assignments, has extensive applications in probabilistic reasoning, network reliability, statistical physics, and formal verification.
Chandran, L. Sunil +2 more
openaire +3 more sources
Learning DNFs under product distributions via {\mu}-biased quantum Fourier sampling
, 2019 We show that DNF formulae can be quantum PAC-learned in polynomial time under product distributions using a quantum example oracle. The best classical algorithm (without access to membership queries) runs in superpolynomial time.
Kanade, Varun +2 more
core
The Approximate Degree of DNF and CNF Formulas [PDF]
, 2022 Alexander A. Sherstov
openalex +1 more source
Complexity theoretic limitations on learning DNF's
, 2014 Using the recently developed framework of [Daniely et al, 2014], we show that under a natural assumption on the complexity of refuting random K-SAT formulas, learning DNF formulas is hard. Furthermore, the same assumption implies the hardness of learning intersections of $ (\log(n))$ halfspaces, agnostically learning conjunctions, as well as virtually
Daniely, Amit, Shalev-Shwatz, Shai
openaire +2 more sources
Polyethylene terephthalate capacitor film doping: Selection of conditions
Учёные записки Казанского университета: Серия Естественные наукиPolyethylene terephthalate (PET) film has good dielectric properties but high radiation-induced conductivity, which can be reduced by doping commercially available electrical insulation films with small electron-trapping molecules.
E. I. Popova +4 more
doaj +1 more source
Design of a Linear Optimal Controller for Mobile Robots Using Distance Normalization Factor
IEEE AccessPrecise and reliable trajectory planning of mobile robots remains a fundamental challenge due to distance-dependent gain sensitivity, dynamic constraints, and nonlinearities in real environments.
Sung-Chan Park +2 more
doaj +1 more source
Distinct trajectory of post-fire GPP across forest types in Siberia
Environmental Research LettersWildfire is one of the dominant disturbances in the Siberian boreal forest, affecting the capacity of forests to uptake carbon. Impacts of wildfires on forest carbon uptake are substantially varied by tree compositions, however, the loss of carbon uptake
Ahreum Lee +3 more
doaj +1 more source