標題: Titlebook: Agents and Artificial Intelligence; 11th International C Jaap van den Herik,Ana Paula Rocha,Luc Steels Conference proceedings 2019 Springer [打印本頁] 作者: ominous 時間: 2025-3-21 18:40
書目名稱Agents and Artificial Intelligence影響因子(影響力)
書目名稱Agents and Artificial Intelligence影響因子(影響力)學科排名
書目名稱Agents and Artificial Intelligence網(wǎng)絡公開度
書目名稱Agents and Artificial Intelligence網(wǎng)絡公開度學科排名
書目名稱Agents and Artificial Intelligence被引頻次
書目名稱Agents and Artificial Intelligence被引頻次學科排名
書目名稱Agents and Artificial Intelligence年度引用
書目名稱Agents and Artificial Intelligence年度引用學科排名
書目名稱Agents and Artificial Intelligence讀者反饋
書目名稱Agents and Artificial Intelligence讀者反饋學科排名
作者: Gnrh670 時間: 2025-3-21 22:48
Reports from Contemporary Businessparse, a prediction model is used to solve this sparsity. We analyze a real-time bidding dataset, and then show that the proposed RL method on this dataset leads to higher revenues. In addition, a sensitivity analysis is performed on the parameters of the method.作者: HILAR 時間: 2025-3-22 03:56 作者: deadlock 時間: 2025-3-22 07:46
https://doi.org/10.1057/9780230509818n the solutions for eight instances with maximal number of weeks, in which six of them were open instances for constraint satisfaction approach, and two of them are computed for the first time, and super-linear speedups are observed for all the instances solved in parallel. Besides, we survey the ex作者: 卷發(fā) 時間: 2025-3-22 08:52
Culture and Power in England, 1585–1685the capacity of a given shunting yard..In the second approach, we investigate whether we can use machine learning to help local search decide which promising areas to explore during search. Therefore, DGCNN is applied to predict the order of search operators in which the local search heuristic shoul作者: Noctambulant 時間: 2025-3-22 13:44 作者: paleolithic 時間: 2025-3-22 19:25
https://doi.org/10.1007/978-1-349-11003-2asic idea of our method is that if agents have long-life batteries, they can appropriately shorten the ACL, and thus can visit important locations with a short interval of time by recharging frequently. However, appropriate ACL must depend on many elements such as environmental size, number of agent作者: Innocence 時間: 2025-3-22 22:09
https://doi.org/10.1007/978-94-009-3711-6ther at one exit at some frequency, despite individual agents choosing the exit randomly. Moreover, the social force model is employed in conjunction with the evacuation decision model to take physical factors such as clogging and collisions into account. The effects of physical factors on both evac作者: Nostalgia 時間: 2025-3-23 04:14
Harold G. Levine,L. L. Langnessrent types of optimization problems and for the first time applied the approach to a real-world optimization problem: to predictive scheduling in virtual power plant orchestration. The lazy agent approach turns out to be competitive and often superior to the non-lazy one and to standard heuristics i作者: CUB 時間: 2025-3-23 08:54
https://doi.org/10.1007/978-1-349-21518-8escribe the results of both prototypes in detail. We evaluate both chatbots defining criteria for both settings in detail and compare the results and draw conclusions for the maturity of chatbot technology for practical use, describing the opportunities and challenges companies, especially small and作者: 睨視 時間: 2025-3-23 13:16
The Dynamics of Semantic Change: A Corpus-Based Analysis,quantitative property associated with linguistic changes, applies in the case of lexical semantic change. We use an automatic procedure to empirically extract words that have known the biggest semantic shifts in the past two centuries from the Google Books N-gram corpus. Then, we investigate the sig作者: 無政府主義者 時間: 2025-3-23 13:51
Reinforcement Learning Method for Ad Networks Ordering in Real-Time Bidding,parse, a prediction model is used to solve this sparsity. We analyze a real-time bidding dataset, and then show that the proposed RL method on this dataset leads to higher revenues. In addition, a sensitivity analysis is performed on the parameters of the method.作者: mitten 時間: 2025-3-23 22:04
A General Approach to Distributed and Privacy-Preserving Heuristic Computation,l planning. We present the general approach, a particular implementation, and an experimental evaluation showing that the presented approach is competitive with the state of the art while having the additional benefits of generality and privacy preservation.作者: 期滿 時間: 2025-3-23 22:16
Social Golfer Problem Revisited,n the solutions for eight instances with maximal number of weeks, in which six of them were open instances for constraint satisfaction approach, and two of them are computed for the first time, and super-linear speedups are observed for all the instances solved in parallel. Besides, we survey the ex作者: 暗指 時間: 2025-3-24 03:15
Boosting Local Search Using Machine Learning: A Study on Improving Local Search by Graph Classificathe capacity of a given shunting yard..In the second approach, we investigate whether we can use machine learning to help local search decide which promising areas to explore during search. Therefore, DGCNN is applied to predict the order of search operators in which the local search heuristic shoul作者: enlist 時間: 2025-3-24 08:15
,Adaptive-Aggressive Traders Don’t Dominate,19 ICAART paper by Cliff claimed that AA’s failings were revealed by testing it in more realistic experiments, with conditions closer to those found in real financial markets, but here we demonstrate that even in the simple experiment conditions that were used in the original AA papers, exhaustive t作者: photophobia 時間: 2025-3-24 11:47
Improvement of Multi-agent Continuous Cooperative Patrolling with Learning of Activity Length,asic idea of our method is that if agents have long-life batteries, they can appropriately shorten the ACL, and thus can visit important locations with a short interval of time by recharging frequently. However, appropriate ACL must depend on many elements such as environmental size, number of agent作者: 聰明 時間: 2025-3-24 15:39
Symmetry Breaking in Evacuation Exit Choice: Impacts of Cognitive Bias and Physical Factor on Evacuther at one exit at some frequency, despite individual agents choosing the exit randomly. Moreover, the social force model is employed in conjunction with the evacuation decision model to take physical factors such as clogging and collisions into account. The effects of physical factors on both evac作者: Clumsy 時間: 2025-3-24 22:57 作者: Spina-Bifida 時間: 2025-3-25 03:03
Conversational Agents for Insurance Companies: From Theory to Practice,escribe the results of both prototypes in detail. We evaluate both chatbots defining criteria for both settings in detail and compare the results and draw conclusions for the maturity of chatbot technology for practical use, describing the opportunities and challenges companies, especially small and作者: enormous 時間: 2025-3-25 03:31 作者: 環(huán)形 時間: 2025-3-25 08:26 作者: Parallel 時間: 2025-3-25 14:48
https://doi.org/10.1057/9780230509818We propose a neural hidden Markov models to compute the transition probabilities of higher-order hidden Markov model by a neural network and reduce the cost of computation. It is applied for time-aware recommender systems to show the benefits from the hybrid of combining neural network and hidden Ma作者: 啞劇 時間: 2025-3-25 18:46
Reports from Contemporary Businesserving multi-agent planning, where multiple agents plan for a common goal but with private information they do not want to disclose. Heuristic search is the dominant technique used in MAP and therefore it is not surprising that a significant attention has been paid to distributed heuristic computati作者: Ganglion-Cyst 時間: 2025-3-25 22:11 作者: 敏捷 時間: 2025-3-26 02:12 作者: 團結(jié) 時間: 2025-3-26 05:59 作者: entail 時間: 2025-3-26 10:30
https://doi.org/10.1057/9780230509818ded belief. Based on Public Announcement Logic, we define our logic, Logic Of Narrow-minded belief (LON), as that which includes such belief. Semantics for LON is provided by the Kripke-style semantics, and using this semantics, we formally analyze the mental state of the hero of Shakespeare’s trage作者: 謙虛的人 時間: 2025-3-26 12:59
https://doi.org/10.1057/9780230509818nts and to improve the productivity in shield tunneling, a widely used tunnel construction method. This study considers the amount of soil excavated along a tunnel composed of the segments as an objective, and the deviation limit as constraints. In this problem, a feasible solution can be easily fou作者: forecast 時間: 2025-3-26 20:51
Culture and Power in England, 1585–1685mputational expensive as it requires to solve an NP-hard shunting planning problem. Currently, NS uses a shunt plan simulator where a local search heuristic is implemented to determine such capacities..In this paper, we study how to combine machine learning with local search in order to speed up fin作者: 膽小鬼 時間: 2025-3-26 21:13
https://doi.org/10.1007/978-1-349-27669-1 drift scenarios by providing the flexibility to consider at each step a portion of the data and derive clusters from it to be used subsequently to update the existing clustering solution. The proposed framework is built around the idea to model two clustering solutions as a bipartite graph, which g作者: Nmda-Receptor 時間: 2025-3-27 02:57
The Intelligentsia in War and Revolution,nto it. Our research aims at a simple and practical Wide and Deep Reinforcement Learning framework to extend DRL algorithms by combining linear (wide) and non-linear (deep) methods. This framework can help to integrate expert knowledge or to fuse sensor information while at the same time improving t作者: ARIA 時間: 2025-3-27 08:20 作者: interlude 時間: 2025-3-27 10:45 作者: TATE 時間: 2025-3-27 14:14 作者: deforestation 時間: 2025-3-27 20:10
Harold G. Levine,L. L. Langness to solve. Especially in the high-dimensional case, a lack of derivatives entails additional challenges to heuristics. High-dimensionality leads to an exponential increase in search space size and tightens the problem of premature convergence. Parallelization for acceleration often involves domain-s作者: manifestation 時間: 2025-3-27 22:40
https://doi.org/10.1007/978-1-349-21518-8show interest in new technologies and their possible applications for customers. German insurance companies generally are interested in improving their customer service and digitizing their business processes. In this work we investigate the potential use of conversational agents in insurance compan作者: Favorable 時間: 2025-3-28 03:58
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/151229.jpg作者: 氣候 時間: 2025-3-28 08:00 作者: disparage 時間: 2025-3-28 11:54
978-3-030-37493-8Springer Nature Switzerland AG 2019作者: 高度贊揚 時間: 2025-3-28 18:18 作者: Binge-Drinking 時間: 2025-3-28 21:43 作者: 可能性 時間: 2025-3-29 00:52 作者: 最高點 時間: 2025-3-29 03:22
Segmentation, Targeting, and Positioningnt weighting functions for approximating the implicit feedback relation weights. Experiments on four real-world datasets show that the proposed model significantly outperforms the state-of-art models. Results also show that selecting the right weighting functions for approximating relation weights significantly improves classification accuracy.作者: 長矛 時間: 2025-3-29 08:54
The Intelligentsia in War and Revolution,hm to Berkeley’s Pac-Man environment. Our algorithm considerably outperforms Deep .-Networks both in terms of learning speed and ultimate performance, showing its potential for boosting existing algorithms. Furthermore, it is robust to the failure of one of its?components.作者: Enzyme 時間: 2025-3-29 12:13
Weighted Personalized Factorizations for Network Classification with Approximated Relation Weights,nt weighting functions for approximating the implicit feedback relation weights. Experiments on four real-world datasets show that the proposed model significantly outperforms the state-of-art models. Results also show that selecting the right weighting functions for approximating relation weights significantly improves classification accuracy.作者: Suppository 時間: 2025-3-29 19:20
Wide and Deep Reinforcement Learning Extended for Grid-Based Action Games,hm to Berkeley’s Pac-Man environment. Our algorithm considerably outperforms Deep .-Networks both in terms of learning speed and ultimate performance, showing its potential for boosting existing algorithms. Furthermore, it is robust to the failure of one of its?components.作者: 費解 時間: 2025-3-29 21:53
Reports from Contemporary Businessting 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.作者: SOB 時間: 2025-3-30 01:40 作者: 寬大 時間: 2025-3-30 04:17 作者: PLAYS 時間: 2025-3-30 10:11
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
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.作者: 單調(diào)女 時間: 2025-3-30 18:05
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
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
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 作者: 值得贊賞 時間: 2025-3-31 12:09
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
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
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
