Results 221 to 230 of about 265,994 (263)
Joint Optimization of Trajectory-Resource Allocation and Deep Task Partial Offloading for MEC-Enabled Multi-UAV. [PDF]
Sensors (Basel)Liu C, Wang Y, Mei H, Du S, Guo B.
europepmc +1 more source
Designing Electronic Problem-Solving Training for Individuals With Traumatic Brain Injury: Mixed Methods, Community-Based, Participatory Research Case Study. [PDF]
J Med Internet ResSchmidt M, Weng Y, Juengst S, Holland A.
europepmc +1 more source
A retrospective observational study of characteristics and outcomes of older patients referred to a hospital-based social prescribing programme. [PDF]
Front Public HealthMcGowan B +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Information Processing Letters, 1990
Abstract ⊕ L is the class of languages acceptable by logarithmic space bounded Turing machines that work nondeterministically and are equipped with parity-acceptance. Several natural problems are shown to be complete for ⊕ L under NC1-reductions. A consequence is that ⊕ L is the 2-analogon of Cook's class DET, the class of problems NC1-reducible ...
openaire +1 more source
Abstract ⊕ L is the class of languages acceptable by logarithmic space bounded Turing machines that work nondeterministically and are equipped with parity-acceptance. Several natural problems are shown to be complete for ⊕ L under NC1-reductions. A consequence is that ⊕ L is the 2-analogon of Cook's class DET, the class of problems NC1-reducible ...
openaire +1 more source
P-Complete Approximation Problems
Journal of the ACM, 1976For P-complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows, quadratic assignment, etc., it is shown that the approximation problem is also P-complete. In contrast with these results, a linear time approximation algorithm for the clustering problem is presented.
Sartaj Sahni, Teofilo F. Gonzalez
openaire +2 more sources
On the optional hamiltonian completion problem
Networks, 1976AbstractThe Optional Hamiltonian Completion Problem is defined as follows: let the points V of a graph G be partitioned into a set V0 of optional points and a set V1 of non‐optional points; determine the minimum number of new lines which when added to G result in a graph which has a cycle containing every point of V1.
Peter J. Slater +2 more
openaire +2 more sources