Approach for Solving Project Assignment with Bicriterion [PDF]
Assigning the right member to the most suitable position is key to the success of a project, and this task has been commonly executed by the project manager based on personal judgment in practice.
Ding-Tsair Chang +3 more
doaj +1 more source
An Online Real-Time Anomaly Detection Method for Microservice Call Chains [PDF]
The microservice architecture is gradually becoming the mainstream design architecture for large-scale cloud applications, and the reliability of systems based on microservices is a key issue that must be addressed by cloud service providers.Accurately ...
ZHANG Pan, GAO Feng, ZHOU Yi, RAO Hanyu, MAO Dong, LI Jing
doaj +1 more source
Improving the Transferability of Adversarial Samples by Path-Augmented Method
Deep neural networks have achieved unprecedented success on diverse vision tasks. However, they are vulnerable to adversarial noise that is imperceptible to humans. This phenomenon negatively affects their deployment in real-world scenarios, especially security-related ones.
Jianping Zhang 0002 +7 more
openaire +2 more sources
Root Cause Analysis (RCA) of Factors Limiting the Success of the Project of Water Pumping Station in Ghomsheh Faraman Village, Kermanshah County [PDF]
Extended abstract IntroductionPopulation growth, drought, climate change, and mismanagement policies have strongly affected the existing water resources.
parvin Amirkhani +2 more
doaj +1 more source
Dynamic asymmetric assignment problem in open multi-agent systems
The purpose of the work is to develop models and algorithms for optimizing matching in dynamically generated graphs of asymmetric relations in coordinated open systems of interacting agents with centralized and collective control.
M. P. Revotjuk +3 more
doaj +1 more source
PENENTUAN MATCHING MAKSIMUM PADA GRAF BIPARTIT BERBOBOT MENGGUNAKAN METODE HUNGARIAN
Matching is a part of graph theory that discuss to make a pair, that can be used to solve many problems; one of them is the assignment problem. The assignment problem is to make a pair problem for n as the employees and for n as the duties, therefore ...
Muchammad Abrori, Rina Wahyuningsih
doaj +3 more sources
Using the binary representation of arc capacity in a polynomial time algorithm for the constrained maximum flow problem in directed networks [PDF]
In this paper, the binary representation of arc capacity has been used in developing an efficient polynomial time algorithm for the constrained maximum flow problem in directed networks.
Muhammad Tlas
doaj
A polynomial time algorithm for the maximal constrained network flow problem based on the bit-arc capacity scaling technique [PDF]
An efficient polynomial time algorithm for solving maximum flow problems in directed networks has been proposed in this paper. The algorithm is basically based on successive divisions of capacities by multiples of two; it solves the maximum flow problem ...
Muhammad Tlas
doaj
A bit-capacity scaling algorithm for the constrained minimal cost network flow problem [PDF]
A polynomial time algorithm for solving the minimum-cost network flow problem has been proposed in this paper. This algorithm is mainly based on the binary representation of capacities; it solves the minimum-cost flow problem in directed graph of n nodes
Muhammad Tlas
doaj
Towards a Trajectory Planning Concept: Augmenting Path Planning Methods by Considering Speed Limit Constraints [PDF]
Trajectory planning is an essential part of systems controlling autonomous entities such as vehicles or robots. It requires not only finding spatial curves but also that dynamic properties of the vehicles (such as speed limits for certain maneuvers) must be followed. In this paper, we present an approach for augmenting existing path planning methods to
Lukás Chrpa, Hugh Osborne
openaire +1 more source

