Results 21 to 30 of about 4,574,423 (281)
Finding Solutions to the Integer Case Constraint Satisfiability Problem Using Grover’s Algorithm
IEEE Transactions on Quantum Engineering, 2021 Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover’s search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high probability for
Gayathree M. Vinod, Anil Shaji
doaj +1 more source
FINDING OF OPTIMAL SUBSET STRUCTURE IN THE KNAPSACK PROBLEM
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019 An algorithm for solving the knapsack problem based on the proposed multi-criteria model is considered. The implementation of this algorithm allows to define the structure of the optimal subset as a union of certain elements of a Pareto layers group into
S. V. Chebakov, L. V. Serebryanaya
doaj +1 more source
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model [PDF]
, 2019 13 pagesThis paper considers the triangle finding problem in the CONGEST model of distributed computing. Recent works by Izumi and Le Gall (PODC'17), Chang, Pettie and Zhang (SODA'19) and Chang and Saranurak (PODC'19) have successively reduced the ...
Gall, François Le +2 more
core +2 more sources
The un-designability of the virtual. Design from problem-solving to problem-finding. [PDF]
, 2018 Drawing on Gilles Deleuze (1991) this chapter investigates the virtual as what problematizes the possible by inserting contingency in the process of emergence of the new.
Marenko, Betti
core
Pediatric Blood &Cancer, EarlyView.ABSTRACT Purpose Although not always achieved, complete chemotherapy‐induced nausea and vomiting (CINV) control is the conventional goal of CINV prophylaxis. In this two‐center, mixed‐methods study, we sought to understand the preferences of adolescent patients and family caregivers for CINV control endpoints.
Haley Newman +8 more
wiley +1 more source
Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem [PDF]
, 2012 Graph G is the square of graph H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Given H it is easy to compute its square H^2.
Farzad, Babak, Karimi, Majid
core
Quantum Computation as Geometry
, 2006 Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the shortest path ...
Doherty, Andrew C. +3 more
core +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background PIK3CA‐related overgrowth spectrum (PROS) includes several rare overgrowth disorders resulting from somatic gain‐of‐function mutations in PIK3CA. Despite treatment advances, including the recent approval of alpelisib for PROS in the United States, literature detailing the patient experience with PROS is limited.
Vamsi Bollu +8 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT End‐of‐life conversations with adolescents and young adults (AYAs) with cancer rarely occur without the guidance of healthcare professionals. As a part of the ‘Difficult Discussions’ study, focused on palliative care and advance care planning discussions with AYAs with cancer, we investigated the factors that healthcare professionals identify ...
Justine Lee +9 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Survivors of childhood acute lymphoblastic leukemia (ALL) often exhibit early deficits in muscle and movement competence, which can compromise long‐term health. Integrative neuromuscular training (INT), a multifaceted approach combining fundamental movement activities with strength exercises, may help address these deficits during ...
Anna Maria Markarian +7 more
wiley +1 more source