2014 IEEE 26th International Conference on Tools with Artificial Intelligence最新文献_第6页

Adversarial Cooperative Path-Finding: Complexity and Algorithms 对抗性合作寻径:复杂性和算法

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.22

M. Ivanová, Pavel Surynek

{"title":"Adversarial Cooperative Path-Finding: Complexity and Algorithms","authors":"M. Ivanová, Pavel Surynek","doi":"10.1109/ICTAI.2014.22","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.22","url":null,"abstract":"The paper addresses a problem of adversarial cooperative path-finding (ACPF) which extends the well-studied problem of cooperative path-finding (CPF) with adversaries. In addition to cooperative path-finding where non-colliding paths for multiple agents connecting their initial positions and destinations are searched, consideration of agents controlled by the adversary is included in ACPF. This work is focused on both theoretical properties and practical solving techniques of the considered problem. We study computational complexity of the problem where we show that it is PSPACE-hard and belongs to the EXPTIME complexity class. Possible methods suitable for practical solving of the problem are introduced and thoroughly evaluated. Suggested solving approaches include greedy algorithms, minimax methods, Monte Carlo Tree Search, and adaptation of an algorithm for the cooperative version of the problem. Solving methods for ACPF were compared in a tournament in which all the pairs of suggested strategies were compared. Surprisingly frequent success rate of greedy methods and rather weaker results of Monte Carlo Tree Search were indicated by the conducted experimental evaluation.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129551256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

A Risk Assessment and Alerting System for Maritime Attacks 海上攻击风险评估与预警系统

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.84

S. Fossier

引用次数: 1

A Space Efficient Scheme for Persistent Graph Representation 持久图表示的空间高效方案

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.52

Stavros Kontopoulos, G. Drakopoulos

引用次数: 22

Detecting and Describing Historical Periods in a Large Corpora 大型语料库中历史时期的检测与描述

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.118

T. Popa, Traian Rebedea, Costin-Gabriel Chiru

引用次数: 4

Random Generation and Population of Probabilistic Relational Models and Databases 概率关系模型与数据库的随机生成与总体

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.117

Mouna Ben Ishak, P. Leray, N. B. Amor

引用次数: 3

Constraint-Based Local Search for the Distance- and Capacity-Bounded Network Design Problem 基于约束的局部搜索的距离和容量有限网络设计问题

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.35

Alejandro Arbelaez, D. Mehta, B. O’Sullivan, L. Quesada

{"title":"Constraint-Based Local Search for the Distance- and Capacity-Bounded Network Design Problem","authors":"Alejandro Arbelaez, D. Mehta, B. O’Sullivan, L. Quesada","doi":"10.1109/ICTAI.2014.35","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.35","url":null,"abstract":"Many network design problems arising in the fields of transportation, distribution and logistics require clients to be connected to facilities through a set of carriers subject to distance and capacity constraints. Here a carrier could be a cable, vehicle, salesman etc. The distance from a facility to client using a carrier could be expressed as signal loss, time spent, path length, etc. The capacity of a carrier could be interpreted as the maximum number of commodities that a carrier can carry, the maximum number of clients or links that a single carrier can visit, etc. The main decisions are to determine the number of carriers, assign clients to carriers, and design a network for each carrier subject to distance, capacity and some side constraints. In this paper, we focus on the Cable Routing Problem (CRP), which is NP-hard. We present a constraint-based local search algorithm and two efficient local move operators. The effectiveness of our approach is demonstrated by experimenting with 300 instances of the CRP taken from real-world passive optical network deployments in Ireland. The results show that our algorithm can scale to very large problem instances and it can compute good quality solutions in a very limited time.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125525211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Automated Generation of Region Based Geometric Questions 基于区域的几何问题自动生成

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.129

Rahul Singhal, M. Henz

{"title":"Automated Generation of Region Based Geometric Questions","authors":"Rahul Singhal, M. Henz","doi":"10.1109/ICTAI.2014.129","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.129","url":null,"abstract":"We extend our previously proposed framework that combines a combinatorial approach, pattern matching and automated deduction to generate geometry questions which, directly or indirectly, require finding the congruent regions formed by the intersection of geometric objects. The extension involves proposing a knowledge representation for regions and a rule-based algorithm for generation of region-based knowledge representation. In addition, several algorithms such as circle/arc projection to straight line (s) are proposed to avoid numerical reasoning for proving congruent regions, making the solution eligible for high school geometry domain. Furthermore, we propose the integration of this framework with our previously proposed framework to generate questions involving both implicit construction and congruent regions. The system is able to generate the solution (s) of the questions for their validation. Such a system would help teachers to quickly generate large numbers of questions based on several properties of geometric objects such as length, angle, area and perimeter. Students can explore, revise and master specific topics covered in classes and textbooks based on generated questions. This system may also help standardize tests such as Primary School Leaving Exam (PSLE), GMAT and SAT. Our methodology uses (i) a combinatorial approach for generating geometric figures (ii) Pattern matching and rule-based approach for region generation (iii) automated deduction for checking equality of properties of geometric objects (iv) linear equation solver to generate new questions and solutions. By combining these methods, we are able to generate questions involving finding or proving congruence relationships between the regions generated by the geometric objects based on a various specifications such as objects and concepts. Experimental results show that a large number of questions can be generated in a short time. A survey shows that the generated questions and the solutions are useful and fulfills the high school criteria.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125661230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

A Multi-agent Homophily-Based Approach for Community Detection in Social Networks 基于多智能体同质性的社交网络社区检测方法

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.81

H. Zardi, L. Romdhane, Z. Guessoum

引用次数: 7

Probing-Based Variable Selection Heuristics for NCSPs 基于探测的ncsp变量选择启发式算法

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.14

Víctor Reyes, Ignacio Araya

引用次数: 1

CHOROS 2: Improving the Performance of Qualitative Spatial Reasoning in OWL CHOROS 2:提高OWL中定性空间推理的性能

2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.50

N. Mainas, E. Petrakis

引用次数: 5