PLAYS
发表于 2025-3-30 10:11:34
Multi-agent Path Finding with Generalized Conflicts: An Experimental Study,ting optimal algorithms for MAPF: search-based CBS, and propositional satisfiability (SAT) - based MDD-SAT and SMT-CBS. These algorithms were modified to tackle various types of conflicts. The major contribution of this paper is a thorough experimental evaluation of CBS, MDD-SAT, and SMT-CBS on various types of relocation problems.
Recess
发表于 2025-3-30 15:29:48
Application of PSO-Based Constrained Combinatorial Optimization to Segment Assignment in Shield Tunible region. A two-dimensional simulation experiment using real-world construction data was performed to evaluate the effectiveness of the proposed method. The results demonstrate that the proposed method statistically outperforms the work of skilled engineers and other comparative methods in all test problems.
单调女
发表于 2025-3-30 18:05:24
Bipartite Split-Merge Evolutionary Clustering,rmed by splitting their elements among several new clusters. We have evaluated and compared the discussed evolutionary clustering technique with two other state of the art algorithms: a bipartite correlation clustering (PivotBiCluster) and an incremental evolving clustering (Dynamic split-and-merge).
剥削
发表于 2025-3-30 21:48:02
Conference proceedings 2019d and selected from 202 initial submissions. 17 of the 46 full papers were selected to be included in this volume. These papers deal with topics such as natural language processing, artificial intelligence, and agents..
ANN
发表于 2025-3-31 01:34:42
0302-9743 ly reviewed and selected from 202 initial submissions. 17 of the 46 full papers were selected to be included in this volume. These papers deal with topics such as natural language processing, artificial intelligence, and agents..978-3-030-37493-8978-3-030-37494-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
Arroyo
发表于 2025-3-31 05:56:03
http://reply.papertrans.cn/16/1513/151229/151229_56.png
值得赞赏
发表于 2025-3-31 12:09:26
0302-9743 elligence, ICAART 2019, held in Prague, Czech Republic, in February 2019...Overall, 46 full papers, 66 short papers, and 36 poster papers were carefully reviewed and selected from 202 initial submissions. 17 of the 46 full papers were selected to be included in this volume. These papers deal with to
genesis
发表于 2025-3-31 14:41:34
https://doi.org/10.1057/9780230509818e cost of computation. It is applied for time-aware recommender systems to show the benefits from the hybrid of combining neural network and hidden Markov model. We implement the recommender system and experiment on real datasets to demonstrate better performances over the existing recommender systems.
ATP861
发表于 2025-3-31 18:53:24
Neural Hidden Markov Model,e cost of computation. It is applied for time-aware recommender systems to show the benefits from the hybrid of combining neural network and hidden Markov model. We implement the recommender system and experiment on real datasets to demonstrate better performances over the existing recommender systems.
archenemy
发表于 2025-4-1 00:37:47
http://reply.papertrans.cn/16/1513/151229/151229_60.png