Symposium on Combinatorial Search - 2012

组合搜索研讨会 - 2012

• 批准号: 1241561
• 负责人: Richard Korf
• 金额: $ 1.7万
• 依托单位: University of California-Los Angeles
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2012
• 资助国家: 美国
• 起止时间: 2012-06-15 至 2014-05-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1241561&HistoricalAwards=false
• 关键词: Symposium; Combinatorial; Search; 2012

This award supports participation of US-based graduate student researchers in the 2012 Symposium on Combinatorial Search (SoCS 2012) to be held July 19-21, 2012 in Niagara Falls, Canada, just prior to the Twenty-Sixth Conference on Artificial Intelligence (AAAI-12) to be held July 22-26 in Toronto. The funds will help defray the travel, lodging, and registration costs for 13 graduate students as well as two invited speakers. SoCS 2012 will bring together researchers in all aspects of heuristic search and combinatorial optimization and its use in a broad range of areas in AI including core topics of Robust Intelligence like robotics, planning, constraint programming, and in other areas of interest across IIS like bioinformatics. One of the oldest subareas of research in AI, search continues to grow. Its advances include real-time search, parallel search, search using external memory, methods for using inconsistent heuristics, etc. Today it is central to solving problems in areas as diverse as optimal alignment of DNA sequences and real-time navigation. A special focus of SoCS 2012 is path-planning, which is important in robotics and computational biology. SoCS 2012 will include a new grid-based path planning competition.

该奖项支持美国研究生研究人员参加2012年7月19日至21日在加拿大尼亚加拉福尔斯举行的2012年组合搜索研讨会（SoCS 2012），就在7月22日至26日在多伦多举行的第二十六届人工智能会议（AAAI-12）之前。这笔资金将用于支付13名研究生和两名受邀演讲者的旅费、住宿费和注册费。SoCS 2012将汇集启发式搜索和组合优化的各个方面的研究人员，并将其用于AI的广泛领域，包括Robust Intelligence的核心主题，如机器人技术，规划，约束编程，以及IIS中其他感兴趣的领域，如生物信息学。作为人工智能研究中最古老的子领域之一，搜索仍在继续增长。它的进步包括实时搜索，并行搜索，搜索使用外部存储器，使用不一致的化学方法等，今天它是解决问题的核心领域，如DNA序列的最佳比对和实时导航。SoCS 2012的一个特别重点是路径规划，这在机器人和计算生物学中很重要。SoCS 2012将包括一个新的基于网格的路径规划竞赛。