Results 31 to 40 of about 1,085,519 (269)
Discrete Optimization, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Neeldhara Misra +2 more
openaire +2 more sources
Lower Bounds for Approximate LDCs [PDF]
, 2014 We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(α,δ)$-approximate LDC is a set $V$ of $n$ points in $\mathbb{R}^d$ so that, for each $i \in [d]$ there are $Ω(δn)$ disjoint $q$-tuples $(\vec{u}_1,\ldots,\vec{u}_q) $ in $V$ so that
J. Briët (Jop) +3 more
openaire +4 more sources
A lower bound on opaque sets [PDF]
Computational Geometry, 2019 13 pages, 10 ...
Akitoshi Kawamura +3 more
openaire +5 more sources
Energies, 2018 This paper proposes an improved interval fuzzy modeling (imIFML) technique based on modified linear programming and actual boundary points of data. The imIFML technique comprises four design stages. The first stage is based on conventional interval fuzzy
Nguyen Gia Minh Thao, Kenko Uchida
doaj +1 more source
Setting lower bounds on truthfulness [PDF]
Games and Economic Behavior, 2018 We present and discuss general techniques for proving inapproximability results for truthful mechanisms. We make use of these techniques to prove lower bounds on the approximability of several non-utilitarian multi-parameter problems. In particular, we demonstrate the strength of our techniques by exhibiting a lower bound of $2-\frac{1}{m}$ for the ...
Ahuva Mu'alem, Michael Schapira
openaire +2 more sources
IEEE Access, 2023 This paper considers the hybrid flow shop scheduling problem, where jobs are processed in $m$ stages with the same route of the stage. Each stage has identical parallel machines for processing jobs.
Yarong Chen, Ya-Chih Tsai, Fuh-Der Chou
doaj +1 more source
The Gilbert-Varshamov Bound for Stabilizer Codes Over
IEEE Access, 2018 Quantum codes over finite rings have received a great deal of attention in recent years. Compared with quantum codes over finite fields, a notable advantage of quantum codes over finite rings is that they can adapt to quantum physical systems of ...
Nianqi Tang +3 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Type 1 plasminogen deficiency (PLGD‐1) is an ultra‐rare autosomal recessive disorder caused by variants in the PLG gene and affects approximately 1.6 individuals per million. The condition is characterized by decreased plasminogen levels and impaired function, resulting in fibrin‐rich lesions on mucous membranes throughout the body.
Charles Nakar +7 more
wiley +1 more source
Quantum lower bounds by polynomials [PDF]
Journal of the ACM, 2001 We examine the number of queries to input variables that a quantum algorithm requires to compute Boolean functions on {0,1} N in the black-box model. We show that the exponential quantum speed-up obtained for partial functions (i.e ...
Beals, C.R. +4 more
openaire +4 more sources
IEEE Access, 2019 The identical parallel processors scheduling problem with no-idle time, release date, and delivery time is addressed in this paper. The problem considers a family of tasks that has to be processed by identical parallel processors without idle time.
Lotfi Hidri +2 more
doaj +1 more source