Results 351 to 360 of about 5,507,173 (401)
Some of the next articles are maybe not open access.
Efficiently Computing Top-K Shortest Path Join
International Conference on Extending Database Technology, 2015Driven by many applications, in this paper we study the problem of computing the top-k shortest paths from one set of target nodes to another set of target nodes in a graph, namely the top-k shortest path join (KPJ) between two sets of target nodes ...
Lijun Chang +4 more
semanticscholar +1 more source
Learning-Aided Computation Offloading for Trusted Collaborative Mobile Edge Computing
IEEE Transactions on Mobile Computing, 2020Cooperative offloading in mobile edge computing enables resource-constrained edge clouds to help each other with computation-intensive tasks. However, the power of such offloading could not be fully unleashed, unless trust risks in collaboration are ...
Yuqing Li +5 more
semanticscholar +1 more source
2008
Definition In the United states, only 9.3% of the households do not have cars. Driving is part of people’s daily life. GIS systems like MapQuest and MapPoint are heavily relied on to provide driving directions. However, surprisingly enough, existing systems either ignore the driving speed on road networks, or assume the speed remains constant on the ...
openaire +2 more sources
Definition In the United states, only 9.3% of the households do not have cars. Driving is part of people’s daily life. GIS systems like MapQuest and MapPoint are heavily relied on to provide driving directions. However, surprisingly enough, existing systems either ignore the driving speed on road networks, or assume the speed remains constant on the ...
openaire +2 more sources
IEEE Transactions on Industrial Informatics, 2020
Accidents often occur at sea, so effective maritime search and rescue is essential. In the current process of sea search and rescue, the operation efficiency of large search and rescue equipment is low and it cannot provide stable communication link.
Tingting Yang +4 more
semanticscholar +1 more source
Accidents often occur at sea, so effective maritime search and rescue is essential. In the current process of sea search and rescue, the operation efficiency of large search and rescue equipment is low and it cannot provide stable communication link.
Tingting Yang +4 more
semanticscholar +1 more source
The Path Computation Element (PCE)
2015The Internet Engineering Task Force (IETF) has promoted the Path Computation Element (PCE) architecture to provide effective network resource utilization while guaranteeing advanced Internet applications with adequate quality of service (QoS). The PCE is a dedicated network entity devoted to path computation.
PAOLUCCI, Francesco, CUGINI, FILIPPO
openaire +1 more source
IEEE transactions on industrial electronics (1982. Print), 2019
In this paper, a design method is presented for path-following control of underactuated autonomous underwater vehicles subject to velocity and input constraints, as well as internal and external disturbances. In the guidance loop, a kinematic control law
Zhouhua Peng, Jun Wang, Q. Han
semanticscholar +1 more source
In this paper, a design method is presented for path-following control of underactuated autonomous underwater vehicles subject to velocity and input constraints, as well as internal and external disturbances. In the guidance loop, a kinematic control law
Zhouhua Peng, Jun Wang, Q. Han
semanticscholar +1 more source
Computing almost shortest paths
ACM Transactions on Algorithms, 2001We study the <i>s-sources almost shortest paths</i> (abbreviated <i>s-ASP</i>) problem. Given an unweighted graph <i>G</i> = (<i>V,E</i>), and a subset <i>S</i> ⊆ <i>V</i> of <i>s</i> nodes, the goal is to compute almost shortest paths between all ...
openaire +3 more sources
On the scalability of interdomain path computations
2014 IFIP Networking Conference, 2014Recent research has considered various architectural approaches in which route determination occurs separately from forwarding. Such offers many advantages, but also brings a number of challenges, not least of which is scalability. In this paper we consider the problem of computing domain-level end-to-end routes in the Internet.
Kenneth L. Calvert +2 more
openaire +2 more sources
Intricacies of quantum computational paths
Quantum Information Processing, 2012Graph search represents a cornerstone in computer science and is employed when the best algorithmic solution to a problem consists in performing an analysis of a search space representing computational possibilities. Typically, in such problems it is crucial to determine the sequence of transitions performed that led to certain states.
Luís Tarrataca, Andreas Wichert
openaire +1 more source
An algorithm to compute collusion paths
Proceedings of INFOCOM '97, 2002In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting from their initial knowledge, and have presented a complete solution for a special case of the problem.
Steven H. Low, Nicholas F. Maxemchuk
openaire +2 more sources