2014 13th Mexican International Conference on Artificial Intelligence最新文献

On Automatic Theorem Proving with ML 用ML自动证明定理

2014 13th Mexican International Conference on Artificial Intelligence Pub Date : 2014-11-16 DOI: 10.1109/MICAI.2014.42

Juan Pablo Munoz Toriz, I. M. Ruiz, José Ramón Enrique Arrazola-Ramírez

引用次数: 6

2014 13th Mexican International Conference on Artificial Intelligence Pub Date : 2014-11-16 DOI: 10.1109/MICAI.2014.7

J. Trejo, G. Sidorov, Marco Moreno, Sabino Miranda-Jiménez, Rodrigo Cadena Martínez

引用次数: 1

Time Series Forecasting with PSO-Optimized Neural Networks 基于pso优化神经网络的时间序列预测

2014 13th Mexican International Conference on Artificial Intelligence Pub Date : 2014-11-16 DOI: 10.1109/MICAI.2014.22

Daniel Alba-Cuellar, A. Zavala, A. H. Aguirre, E. E. P. D. L. Sentí, E. Díaz-Díaz

引用次数: 3

Enhanced Knowledge Discovery Approach in Textual Case Based Reasoning 基于文本案例推理的增强知识发现方法

2014 13th Mexican International Conference on Artificial Intelligence Pub Date : 2014-11-16 DOI: 10.1109/MICAI.2014.11

Islam Elhalwany, Ammar Mohammed, K. Wassif, H. Hefny

引用次数: 1

Mining Academic Data Using Visual Patterns 使用视觉模式挖掘学术数据

2014 13th Mexican International Conference on Artificial Intelligence Pub Date : 2014-11-16 DOI: 10.1109/MICAI.2014.20

G. Martínez-Luna, Jesús-Manuel Olivares-Ceja, Eric Ortega Villanueva, A. Guzmán-Arenas

引用次数: 0

Solving a Scholar Timetabling Problem Using a Genetic Algorithm - Study Case: Instituto Tecnologico De Zitacuaro 用遗传算法求解学者课程表问题-研究案例:济塔卡罗理工学院

2014 13th Mexican International Conference on Artificial Intelligence Pub Date : 2014-11-16 DOI: 10.1109/MICAI.2014.36

Noel E. Rodríguez-Maya, J. Martínez-Carranza, J. Flores, Mario Graff

{"title":"Solving a Scholar Timetabling Problem Using a Genetic Algorithm - Study Case: Instituto Tecnologico De Zitacuaro","authors":"Noel E. Rodríguez-Maya, J. Martínez-Carranza, J. Flores, Mario Graff","doi":"10.1109/MICAI.2014.36","DOIUrl":"https://doi.org/10.1109/MICAI.2014.36","url":null,"abstract":"The Scholar Timetabling Problem consists of fixing a sequence of meetings between lecturers, classrooms and schedule to a set of groups and courses in a given period of time, satisfying a set of different constraints, where each course, lecturer, classroom, and time have special features, this problem is known to be NP-hard. Given the impossibility to solve this problem optimally, traditional and metaheuristic methods have been proposed to provide near-optimal solutions. This paper shows the implementation of a Genetic Algorithm (GA) using a real coding to solve the Scholar Timetabling Problem. A naive representation for chromosomes in a population-based heuristic search leads to high probabilities of violation of the problem constraints. To convert solutions that violate constraints (unfeasible solutions) into ones that do not (feasible solutions), we propose a repair mechanism. Based on the proposed mechanism, we present a possible solution to the Scholar Timetabling Problem applied to a real school (Instituto Tecnologico de Zitacuaro). Here we present experimental results based on different types of GA configurations to solve this problem and present the best GA configuration to solve the study case.","PeriodicalId":189896,"journal":{"name":"2014 13th Mexican International Conference on Artificial Intelligence","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124946663","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}

引用次数: 4

Characterization and Numerical Evaluation of a Color Image Segmentation Method 一种彩色图像分割方法的特性与数值评价

2014 13th Mexican International Conference on Artificial Intelligence Pub Date : 2014-11-16 DOI: 10.1109/MICAI.2014.14

Rodolfo Alvarado-Cervantes, E. Riverón, Vladislav Khartchenko

引用次数: 0

Introducing Simulated Annealing in Partial Order Planning 部分序规划中的模拟退火

2014 13th Mexican International Conference on Artificial Intelligence Pub Date : 2014-11-16 DOI: 10.1109/MICAI.2014.35

Rosa Liliana Gonzalez Arredondo, Romeo Sanchez, A. Berrones

{"title":"Introducing Simulated Annealing in Partial Order Planning","authors":"Rosa Liliana Gonzalez Arredondo, Romeo Sanchez, A. Berrones","doi":"10.1109/MICAI.2014.35","DOIUrl":"https://doi.org/10.1109/MICAI.2014.35","url":null,"abstract":"One of the most popular algorithms in the field of domain independent planning is POP - partial order planning. POP considers a least commitment strategy to solve planning problems. Such strategy delays commitments during the planning phase until it is absolutely necessary. In consequence, the algorithm provides greater flexibility for solving planning problems, but with a higher cost in performance. POP-based techniques do not consider search states, instead, search nodes represent partial plans. Recent advances in planning on distance based heuristics and reach ability analysis have helped POP planners to solve more planning problems than before. Although such heuristic techniques have demonstrated to boost performance for POP algorithms, they still remain behind state space planners. We believe that this is mainly due to the partial order representation of the search nodes in POP. In this article, instead of proposing additional heuristics for POP, we enable POP to consider different areas of its search space. We think that the basic POP algorithm follows a greedy path in its search space suffering from local optima problems, from where it cannot recover. To this extent, we have augmented POP with a simulated annealing procedure, which considers worst solutions with certain probability. The augmented algorithm produces promising results in our empirical evaluation, returning up to 19% more solutions in the problems being considered.","PeriodicalId":189896,"journal":{"name":"2014 13th Mexican International Conference on Artificial Intelligence","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134164407","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}

引用次数: 1

Characterization of Nanotube Structures Using Digital-Segmented Images 利用数字分割图像表征纳米管结构

2014 13th Mexican International Conference on Artificial Intelligence Pub Date : 2014-11-16 DOI: 10.1109/MICAI.2014.15

Orlando Aguilar, Teresa E. M. Alarcón, Oscar Dalmau Cedeño, A. Zamudio

引用次数: 2

Peer Recommendation Based on Text Mining Algorithm 基于文本挖掘算法的同行推荐

2014 13th Mexican International Conference on Artificial Intelligence Pub Date : 2014-11-16 DOI: 10.1109/MICAI.2014.12

S. Aciar

引用次数: 0