Zobrazeno 1 - 10
of 299
pro vyhledávání: '"Min-conflicts algorithm"'
Publikováno v:
RIVF
This paper presents a min-conflicts algorithm to find a maximum weakly stable matching for the Hospitals/Residents problem with Ties (MAX-HRT). We represent the problem in terms of a constraint satisfaction problem and apply a local search approach t
Publikováno v:
IEEE Sensors Journal. 17:7694-7703
This paper addresses the camera placement problem for smart cities in 3-D space and proposes a heuristic algorithm that maximizes the weighted coverage rate while satisfying the budget constraint. We first discuss about the quantization of surveillan
Publikováno v:
International Journal of Database Management Systems. 9:11-20
Autor:
Eghbal Hosseini
Publikováno v:
Asian Journal of Scientific Research. 10:227-235
Autor:
Seyed Mojtaba Saif
Publikováno v:
Intelligent Decision Technologies. 11:127-136
Autor:
Akash Nag
Publikováno v:
International Journal of Mathematical Sciences and Computing. 3:55-61
Publikováno v:
IEEE Latin America Transactions. 15:510-516
This paper proposes a new heuristic algorithm for combinatorial optimization. This algorithm is based on genetic algorithm and betting theory. It applies probabilistic recombination to a solution given as input and returns a new solution much more op
Publikováno v:
IEEE Access, Vol 5, Pp 8752-8762 (2017)
Heuristic search is an important part of modern dynamic symbolic execution (DSE) tools, as heuristic search can be used to effectively explore the large program input space. Searching task remains one of several research challenges due to the fact th
Autor:
Wang Minhui, Gao Xia
Publikováno v:
Multimedia Tools and Applications. 76:17231-17253
A* algorithm is widely used in the game for diameter, is currently one of the more popular heuristic search algorithm, but the algorithm has the problem of searching time and path. In this paper, a bidirectional search A* algorithm is proposed to imp
Publikováno v:
Engineering Applications of Artificial Intelligence. 50:201-214
In this paper, we introduced a practical version of golden section search algorithm to optimize multi/uni-modal objective functions. Accordingly, this study presented a novel algorithm combining the capabilities of chaotic maps and the golden section