Results 71 to 80 of about 7,890,208 (208)

Nash fairness solutions for balanced TSP

open access: yes, 2022
In this paper, we consider a variant of the Traveling Salesman Problem (TSP), called Balanced Traveling Salesman Problem (BTSP) [7]. The BTSP seeks to find a tour which has the smallest maxmin distance : the difference between the maximum edge cost and the minimum one.
Nguyen, Minh Hieu   +3 more
openaire   +1 more source

Dynamic channel selection in unknown environment based on graphical game and multi-Q learning

open access: yesTongxin xuebao, 2013
For the problem of dynamic channel selection in unknown distributed environment without a priori knowledge and information exchange, multi-Q learning was proposed.
Fang-wei LI, Yong-chuan TANG, Jiang ZHU
doaj  

Home - About - Disclaimer - Privacy