Results 61 to 70 of about 243,105 (216)
Optimization of Fuzzy Logic Controller Used for a Differential Drive Wheeled Mobile Robot
The energy-efficient motion control of a mobile robot fueled by batteries is an especially important and difficult problem, which needs to be continually addressed in order to prolong the robot’s independent operation time.
Alexandr Štefek+3 more
doaj +1 more source
Visualisasi Pembelajaran Algoritma Dijkstra pada Protokol Routing Open Shortest Path First [PDF]
Open Shortest Path First merupakan sebuah routing protokol yang hanya dapat bekerja dalam jaringan internal di mana masih memiliki hak administrasi terhadap jaringan tersebut.
KHOIRUL, MIFTAKH
core
Interdiction Problems on Planar Graphs [PDF]
Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded graph. We introduce
Pan, Feng, Schild, Aaron
core +1 more source
Modified ECMP Routing Using Adapted Cost Disjoint Multiple Paths ACDMP [PDF]
Computer network routing is performed based on routing protocol decisions. Open Shortest Path First OSPF is the most known routing protocol. It suffers from congestion problem since it generally uses single (least cost) path to deliver information.
Abbas A. Jasim
doaj
UGV Navigation Optimization Aided by Reinforcement Learning-Based Path Tracking
The success of robotic, such as UGV systems, largely benefits from the fundamental capability of autonomously finding collision-free path(s) to commit mobile tasks in routinely rough and complicated environments.
Minggao Wei+3 more
doaj +1 more source
Approximate Euclidean shortest paths in polygonal domains [PDF]
Given a set $\mathcal{P}$ of $h$ pairwise disjoint simple polygonal obstacles in $\mathbb{R}^2$ defined with $n$ vertices, we compute a sketch $\Omega$ of $\mathcal{P}$ whose size is independent of $n$, depending only on $h$ and the input parameter ...
Inkulu, R, Kapoor, Sanjiv
core +2 more sources
Routing adalah proses pemilihan rute terbaik untuk suatu paket data agar dapat sampai ke tujuannya. Proses routing sangat dibutuhkan dalam proses pengiriman data.
Nur Indah, Yulita Salim, Ramdan Satra
doaj +1 more source
A Matrix Usage for Load Balancing in Shortest Path Routing [PDF]
The Open Shortest Path First (OSPF) protocol is a hierarchical interior gateway protocol (IGP) for routing in Internet Protocol. Traffic flows routed along shortest path and splits the load equally at nodes where a number of outgoing links on the ...
Mustafa, Nor Musliza
core
Traffic Engineering (TE) in IP carrier networks is one of the functions that can benefit from the Software Defined Networking paradigm. By logically centralizing the control of the network, it is possible to "program" per-flow routing based on TE goals ...
Davoli, Luca+4 more
core +1 more source
IMPLEMENTATION OF OPEN SHORTEST PATH FIRST USING INTERNET PROTOCOL VERSION 6
Abstract Open Shortest Path First (OSPF) is one of the routing protocols used by a router to dynamically determine the route of a packet (user information) through an internet work. This paper looked at an Inter-Campus network system which was Configuration using IP Version 6 to Implement Open Shortest Path First.
Blessing Chiadikobi+1 more
openaire +2 more sources