Results 81 to 90 of about 989,695 (238)
Graph Planning with Expected Finite Horizon
, 2018 Graph planning gives rise to fundamental algorithmic questions such as shortest path, traveling salesman problem, etc. A classical problem in discrete planning is to consider a weighted graph and construct a path that maximizes the sum of weights for a ...
Chatterjee, Krishnendu, Doyen, Laurent
core +1 more source
Computing simple paths among obstacles
Computational Geometry, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marek Chrobak +2 more
openaire +2 more sources
Electric Vehicle Charging Warning and Path Planning Method Based on Spark
IEEE Access, 2020 Electric vehicles (EVs) are increasing popular as clean transportation. However electric vehicle (EV) users often encounter a shortage of electricity in the driving process. Especially when vehicle charging path planning system request reaches peak hour,
Dong Ding +5 more
doaj +1 more source
Fault tolerant hypercube computer system architecture [PDF]
, 1989 A fault-tolerant multiprocessor computer system of the hypercube type comprising a hierarchy of computers of like kind which can be functionally substituted for one another as necessary is disclosed.
Chow, Edward, Madan, Herb S.
core +1 more source
, 2018 Quantum computers are a promising candidate to radically expand computational science through increased computing power and more effective algorithms. In particular quantum computing could have a tremendous impact in the field of quantum cosmology.
Kocher, Charles D., McGuigan, Michael
core +1 more source
Disciplines, models, and computers: The path to computational quantum chemistry [PDF]
Studies in History and Philosophy of Science Part A, 2014 Many disciplines and scientific fields have undergone a computational turn in the past several decades. This paper analyzes this sort of turn by investigating the case of computational quantum chemistry. The main claim is that the transformation from quantum to computational quantum chemistry involved changes in three dimensions.
openaire +3 more sources
Research on AGV Path Planning Based on Improved Directed Weighted Graph Theory and ROS Fusion
ActuatorsThis article addresses the common issues of insufficient computing power and path congestion for automated guided vehicles (AGVs) in real-world production environments, as well as the shortcomings of traditional path-planning algorithms that mainly ...
Yinping Li, Li Liu
doaj +1 more source
Routing Optimization of Mobile Network System [PDF]
Engineering and Technology Journal, 2009 To send the packets from source to destination node on optimum route in mobile network,the router must find the path with minimum cost. If intermediate node has fialed, the routingtable will be updated and the path should be changed depending on this ...
Thamir Rashed, Emad Shehab, Dalia Kamal
doaj +1 more source
On a New Method for Computing Trace Anomalies
, 1993 I describe a new method for computing trace anomalies in quantum field theories which makes use of path-integrals for particles moving in curved spaces.
Bastianelli, Fiorenzo
core +1 more source
Computing metric hulls in graphs
, 2018 We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This confirms a conjecture of Albenque and Knauer and implies that there is a polynomial time algorithm to ...
Knauer, Kolja, Nisse, Nicolas
core +2 more sources