Symposium on Combinatorial Search - 2017
组合搜索研讨会 - 2017
基本信息
- 批准号:2227523
- 负责人:
- 金额:$ 1万
- 依托单位:
- 依托单位国家:美国
- 项目类别:Standard Grant
- 财政年份:2022
- 资助国家:美国
- 起止时间:2022-02-15 至 2022-04-30
- 项目状态:已结题
- 来源:
- 关键词:
项目摘要
This grant supports student travel for select students and post-doctoral researchers to participate in the Symposium on Combinatorial Search (SoCS-2017) June 16-17 in Pittsburgh, PA. SoCS is an annual event that brings together researchers in heuristic search and combinatorial optimization drawing from diverse areas of artificial intelligence, planning, robotics, constraint programming, operations research, bioinformatics, and computer games. This consortium is oriented on research and career development for students who have identified their PhD topics and are just embarking on that independent research. Sponsoring student travel to SoCS fosters a community of researchers from otherwise diverse areas of computer science to both advance the state of the art in heuristic search and/or combinatorial optimization, and also use these tools in their research. Students participating in this symposium are also more likely to take full advantage of the top-tier conference in the International Conference on Automated Planning and Scheduling (ICAPS) 2017 taking place immediately prior to this symposium, and co-located with it. The entire event provides an opportunity for students to engage in discussion with scientists from around the world and to explore new research directions and topics.
该补助金支持选定的学生和博士后研究人员参加6月16日至17日在宾夕法尼亚州匹兹堡举行的组合搜索研讨会(SoCS-2017)的学生旅行。 SoCS是一项年度活动,汇集了来自人工智能,规划,机器人,约束编程,运筹学,生物信息学和计算机游戏等不同领域的启发式搜索和组合优化研究人员。这个联盟是面向研究和职业发展的学生谁已经确定了他们的博士课题,并刚刚开始独立的研究。 赞助学生前往SoCS培养了来自计算机科学不同领域的研究人员社区,以推进启发式搜索和/或组合优化的最新技术,并在他们的研究中使用这些工具。 参加本次研讨会的学生也更有可能充分利用在本次研讨会之前举行的2017年国际自动规划与调度会议(ICAPS)的顶级会议,并与之同地举行。整个活动为学生提供了与来自世界各地的科学家进行讨论的机会,并探索新的研究方向和主题。
项目成果
期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)
数据更新时间:{{ journalArticles.updateTime }}
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
数据更新时间:{{ journalArticles.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ monograph.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ sciAawards.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ conferencePapers.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ patent.updateTime }}
Nathan Sturtevant其他文献
A GGP Feature Learning Algorithm
- DOI:
10.1007/s13218-010-0081-8 - 发表时间:
2011-01-11 - 期刊:
- 影响因子:3.600
- 作者:
Mesut Kirci;Nathan Sturtevant;Jonathan Schaeffer - 通讯作者:
Jonathan Schaeffer
Nathan Sturtevant的其他文献
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
{{ truncateString('Nathan Sturtevant', 18)}}的其他基金
NSF-BSF:RI:Small:Collaborative Research:Next-Generation Multi-Agent Path Finding Algorithms
NSF-BSF:RI:小型:协作研究:下一代多智能体路径查找算法
- 批准号:
1815660 - 财政年份:2018
- 资助金额:
$ 1万 - 项目类别:
Standard Grant
Symposium on Combinatorial Search - 2017
组合搜索研讨会 - 2017
- 批准号:
1743637 - 财政年份:2017
- 资助金额:
$ 1万 - 项目类别:
Standard Grant
EAGER: Large-Scale Bidirectional Search
EAGER:大规模双向搜索
- 批准号:
1551406 - 财政年份:2015
- 资助金额:
$ 1万 - 项目类别:
Standard Grant
相似海外基金
Travel: Student Travel Grant for Symposium on Combinatorial Search (SoCS) 2024
旅行:2024 年组合搜索 (SoCS) 研讨会的学生旅行补助金
- 批准号:
2420419 - 财政年份:2024
- 资助金额:
$ 1万 - 项目类别:
Standard Grant
Combinatorial Search-Type Problems for Mobile Agents
移动代理的组合搜索类型问题
- 批准号:
RGPIN-2022-03811 - 财政年份:2022
- 资助金额:
$ 1万 - 项目类别:
Discovery Grants Program - Individual
Comprehensive Search for Novel Antiperovskite Superconductors by Bulk Combinatorial Method
体组合法综合寻找新型反钙钛矿超导体
- 批准号:
22K04193 - 财政年份:2022
- 资助金额:
$ 1万 - 项目类别:
Grant-in-Aid for Scientific Research (C)
Conference: Symposium on Combinatorial Search (SoCS) 2023
会议:2023 年组合搜索 (SoCS) 研讨会
- 批准号:
2235754 - 财政年份:2022
- 资助金额:
$ 1万 - 项目类别:
Standard Grant
Difficult Combinatorial Search Problems and Graph Theory Models and Algorithms for Carbon Frameworks
Carbon框架的困难组合搜索问题以及图论模型和算法
- 批准号:
RGPIN-2014-05864 - 财政年份:2021
- 资助金额:
$ 1万 - 项目类别:
Discovery Grants Program - Individual
Satisfiablity Solving + Computer Algebra: A Powerful New Method for Combinatorial Search
可满足性求解计算机代数:一种强大的组合搜索新方法
- 批准号:
532829-2019 - 财政年份:2020
- 资助金额:
$ 1万 - 项目类别:
Postdoctoral Fellowships
Difficult Combinatorial Search Problems and Graph Theory Models and Algorithms for Carbon Frameworks
Carbon框架的困难组合搜索问题以及图论模型和算法
- 批准号:
RGPIN-2014-05864 - 财政年份:2020
- 资助金额:
$ 1万 - 项目类别:
Discovery Grants Program - Individual
CAREER: Search-Based Optimization of Combinatorial Structures via Expensive Experiments
职业:通过昂贵的实验进行基于搜索的组合结构优化
- 批准号:
1845922 - 财政年份:2019
- 资助金额:
$ 1万 - 项目类别:
Continuing Grant
CAREER: Phase Transitions in Randomized Combinatorial Search and Optimization Problems
职业:随机组合搜索和优化问题中的相变
- 批准号:
1940092 - 财政年份:2019
- 资助金额:
$ 1万 - 项目类别:
Continuing Grant
An Investigation into the Application of Iterated-Local-Search for Combinatorial Optimisation
迭代局部搜索在组合优化中的应用研究
- 批准号:
2297305 - 财政年份:2019
- 资助金额:
$ 1万 - 项目类别:
Studentship