Algorithms and complexity of hard problems: bridging the gap between theory and practice

难题的算法和复杂性:弥合理论与实践之间的差距

基本信息

  • 批准号:
    327587-2009
  • 负责人:
  • 金额:
    $ 1.38万
  • 依托单位:
  • 依托单位国家:
    加拿大
  • 项目类别:
    Discovery Grants Program - Individual
  • 财政年份:
    2012
  • 资助国家:
    加拿大
  • 起止时间:
    2012-01-01 至 2013-12-31
  • 项目状态:
    已结题

项目摘要

It is a widely-held belief among many researchers in algorithmics and artificial intelligence that there remains a lack of theory on the nature of various computationally-hard algorithmic problems in practical fields. The worst-case oriented theory of computational complexity, while having had an enormous impact to the computing world, has proven to be unsatisfactory for providing the much-needed insight into the behavior of many practical algorithms when applied to "typical" instances of real-world problems. In recent years, several new paradigms have emerged to help improve our ability to cope with the intractability of hard algorithmic problems. Among them are probabilistic analysis such as the study of phase transitions and the smoothed analysis of specific algorithms, the theory of parameterized complexity and algorithms, and the theory of exact (exponential-time) algorithms.
算法学和人工智能领域的许多研究人员普遍认为,在实际领域中仍然缺乏关于各种计算困难的算法问题的理论。面向最坏情况的计算复杂性理论虽然对计算世界产生了巨大的影响,但在应用于现实世界问题的“典型”实例时,对许多实际算法的行为提供了急需的洞察力,这已被证明是不令人满意的。近年来,出现了一些新的范例,以帮助提高我们的能力,以科普棘手的算法问题。 其中有概率分析,如相变的研究和特定算法的平滑分析,参数化复杂性和算法的理论,以及精确(指数时间)算法的理论。

项目成果

期刊论文数量(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 }}

Gao, Yong其他文献

Roles of a maize phytochrome-interacting factors protein ZmPIF3 in regulation of drought stress responses by controlling stomatal closure in transgenic rice without yield penalty
玉米光敏色素相互作用因子蛋白 ZmPIF3 在通过控制转基因水稻气孔关闭来调节干旱胁迫反应中的作用而没有产量损失
  • DOI:
    10.1007/s11103-018-0739-4
  • 发表时间:
    2018-07-01
  • 期刊:
  • 影响因子:
    5.1
  • 作者:
    Gao, Yong;Wu, Meiqin;Chen, Jianmin
  • 通讯作者:
    Chen, Jianmin
Role of digitalization, digital competence, and parental support on performance of sports education in low-income college students.
  • DOI:
    10.3389/fpsyg.2022.979318
  • 发表时间:
    2022
  • 期刊:
  • 影响因子:
    3.8
  • 作者:
    Li, Zongxi;Slavkova, Olena;Gao, Yong
  • 通讯作者:
    Gao, Yong
Spatial diversity processing mechanism based on the distributed underwater acoustic communication system.
  • DOI:
    10.1371/journal.pone.0296117
  • 发表时间:
    2024
  • 期刊:
  • 影响因子:
    3.7
  • 作者:
    Zhou, Manli;Zhang, Hao;Lv, Tingting;Gao, Yong;Duan, Yingying
  • 通讯作者:
    Duan, Yingying
Bioactive VS(4)-based sonosensitizer for robust chemodynamic, sonodynamic and osteogenic therapy of infected bone defects.
  • DOI:
    10.1186/s12951-023-02283-6
  • 发表时间:
    2024-01-16
  • 期刊:
  • 影响因子:
    10.2
  • 作者:
    He, Yaqi;Liu, Xin;Lei, Jie;Ma, Liang;Zhang, Xiaoguang;Wang, Hongchuan;Lei, Chunchi;Feng, Xiaobo;Yang, Cao;Gao, Yong
  • 通讯作者:
    Gao, Yong
Optimizing Microstructure Morphology and Reducing Electronic Losses in 1 cm2 Polymer Solar Cells to Achieve Efficiency over 15%
优化%20微观结构%20形态%20和%20减少%20电子%20损耗%20in%201%20cm(2)%20聚合物%20太阳能%20电池%20至%20实现%20效率%20over%2015%
  • DOI:
    10.1021/acsenergylett.9b01447
  • 发表时间:
    2019-10-01
  • 期刊:
  • 影响因子:
    22
  • 作者:
    Fan, Baobing;Zeng, Zhaomiyi;Gao, Yong
  • 通讯作者:
    Gao, Yong

Gao, Yong的其他文献

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

{{ truncateString('Gao, Yong', 18)}}的其他基金

Artificial Intelligence and Network Science: Solution Concepts, Graph-Theoretic Characterizations, and Their Societal Aspects
人工智能和网络科学:解决方案概念、图论特征及其社会方面
  • 批准号:
    RGPIN-2019-04904
  • 财政年份:
    2022
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Artificial Intelligence and Network Science: Solution Concepts, Graph-Theoretic Characterizations, and Their Societal Aspects
人工智能和网络科学:解决方案概念、图论特征及其社会方面
  • 批准号:
    RGPIN-2019-04904
  • 财政年份:
    2021
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Artificial Intelligence and Network Science: Solution Concepts, Graph-Theoretic Characterizations, and Their Societal Aspects
人工智能和网络科学:解决方案概念、图论特征及其社会方面
  • 批准号:
    RGPIN-2019-04904
  • 财政年份:
    2020
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Artificial Intelligence and Network Science: Solution Concepts, Graph-Theoretic Characterizations, and Their Societal Aspects
人工智能和网络科学:解决方案概念、图论特征及其社会方面
  • 批准号:
    RGPIN-2019-04904
  • 财政年份:
    2019
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Computational Problems in Artificial Intelligence and Network Science: Probabilistic Analyses, Graph-Theoretic Characterizations, and Algorithmic Solutions
人工智能和网络科学中的计算问题:概率分析、图论表征和算法解决方案
  • 批准号:
    RGPIN-2014-04848
  • 财政年份:
    2018
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Computational Problems in Artificial Intelligence and Network Science: Probabilistic Analyses, Graph-Theoretic Characterizations, and Algorithmic Solutions
人工智能和网络科学中的计算问题:概率分析、图论表征和算法解决方案
  • 批准号:
    RGPIN-2014-04848
  • 财政年份:
    2017
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Computational Problems in Artificial Intelligence and Network Science: Probabilistic Analyses, Graph-Theoretic Characterizations, and Algorithmic Solutions
人工智能和网络科学中的计算问题:概率分析、图论表征和算法解决方案
  • 批准号:
    RGPIN-2014-04848
  • 财政年份:
    2016
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Computational Problems in Artificial Intelligence and Network Science: Probabilistic Analyses, Graph-Theoretic Characterizations, and Algorithmic Solutions
人工智能和网络科学中的计算问题:概率分析、图论表征和算法解决方案
  • 批准号:
    RGPIN-2014-04848
  • 财政年份:
    2015
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Computational Problems in Artificial Intelligence and Network Science: Probabilistic Analyses, Graph-Theoretic Characterizations, and Algorithmic Solutions
人工智能和网络科学中的计算问题:概率分析、图论表征和算法解决方案
  • 批准号:
    RGPIN-2014-04848
  • 财政年份:
    2014
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Algorithms and complexity of hard problems: bridging the gap between theory and practice
难题的算法和复杂性:弥合理论与实践之间的差距
  • 批准号:
    327587-2009
  • 财政年份:
    2013
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual

相似海外基金

Algorithms and complexity of hard problems: bridging the gap between theory and practice
难题的算法和复杂性:弥合理论与实践之间的差距
  • 批准号:
    327587-2009
  • 财政年份:
    2013
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Algorithms and complexity of hard problems: bridging the gap between theory and practice
难题的算法和复杂性:弥合理论与实践之间的差距
  • 批准号:
    327587-2009
  • 财政年份:
    2011
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Faster algorithms for hard problems like subset sum, syndrome decoding in linear codes and the shortest vector problem, with various applications in complexity theory and cryptography
针对子集和、线性码中的校正子解码和最短向量问题等难题的更快算法,在复杂性理论和密码学中具有多种应用
  • 批准号:
    206738461
  • 财政年份:
    2011
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Priority Programmes
Algorithms and complexity of hard problems: bridging the gap between theory and practice
难题的算法和复杂性:弥合理论与实践之间的差距
  • 批准号:
    327587-2009
  • 财政年份:
    2010
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Algorithms and complexity of hard problems: bridging the gap between theory and practice
难题的算法和复杂性:弥合理论与实践之间的差距
  • 批准号:
    327587-2009
  • 财政年份:
    2009
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Algorithms, heuristics and typical case complexity of hard problems
困难问题的算法、启发式和典型案例复杂性
  • 批准号:
    327587-2006
  • 财政年份:
    2008
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Algorithms, heuristics and typical case complexity of hard problems
困难问题的算法、启发式和典型案例复杂性
  • 批准号:
    327587-2006
  • 财政年份:
    2007
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Algorithms, heuristics and typical case complexity of hard problems
困难问题的算法、启发式和典型案例复杂性
  • 批准号:
    327587-2006
  • 财政年份:
    2006
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Discovery Grants Program - Individual
Solving Computationally Hard Problems Based on Fast Algorithms for Fixed-Parameter Problems
基于固定参数问题的快速算法解决计算难题
  • 批准号:
    15300003
  • 财政年份:
    2003
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Grant-in-Aid for Scientific Research (B)
Approximation of NP-Hard Problems: Algorithms and Complexity
NP 难问题的近似:算法和复杂性
  • 批准号:
    0098180
  • 财政年份:
    2001
  • 资助金额:
    $ 1.38万
  • 项目类别:
    Standard Grant
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了