Titlebook: Computational Data and Social Networks; 8th International Co Andrea Tagarelli,Hanghang Tong Conference proceedings 2019 Springer Nature Swi

mettlesome

A RVND+ILS Metaheuristic to Solve the Delivery Man Problem with Time Windows(ILS). The proposed algorithm is tested on the DMPTW benchmark instances from the literature. The results indicate that the developed algorithm has improved the best solutions for 34 instances in a reasonable computation time.

FRET

修改

Neural Networks with Multidimensional Cross-Entropy Loss Functionsf cross-entropy, referred to as multidimensional cross-entropy, and its application as a loss function for classification using neural networks. The presented computational experiments on a benchmark dataset suggest that the proposed approaches may have a potential for increasing the classification accuracy of neural network based algorithms.

没有贫穷

Jocose

Cuisine

labile

Location-Based Competitive Influence Maximization in Social Networkstitors are conducting a similar strategy. We propose a greedy algorithm with . approximation ratio and a heuristic algorithm LCIM-MIA based on MIA structure. Experimental results on real-world datasets show that our methods often better than several baseline algorithms.

Obedient

范例

A Probabilistic Divide and Conquer Algorithm for the Minimum Tollbooth Problemtional toll for the use of edges. We consider a variant of this problem, the minimum tollbooth problem, which additionally minimizes the number of tolled edges. Since the problem is NP-hard, heuristics and evolutionary algorithms dominate solution approaches. To the best of our knowledge, for none o

档案