首页> 外文期刊>Nature >Can get satisfaction
【24h】

Can get satisfaction

机译:可以得到满意的

获取原文
获取原文并翻译 | 示例
           

摘要

The sheer complexity of some computational problems means they will probably never be solved, despite the ever-increasing resources available. But we can sometimes predict under what conditions solutions exist. Computer scientists have been quite successful at developing fast algorithms: Google, for example, searches its index of more than eight billion web pages in a fraction of a second. The indexed-search problem is said to be 'tractable', or efficiently solvable; it is even possible to guaranteethat, no matter what keywords you search on, you will get an answer quickly. Such a worst-case efficiency guarantee is the gold standard for algorithm design. But unfortunately, such a guarantee is not always possible: for many computational problems, wecan either prove that no efficient algorithm exists, or we have good evidence that such an algorithm is unlikely to exist Achlioptas et al (page 759 of this issue) provide a series of rigorous insights into a class of computational puzzles — known as constraint-satisfaction problems — that occur in areas as diverse as the scheduling of airline and train crews, data-mining, software design and computational biology.
机译:尽管可用资源不断增加,但某些计算问题的绝对复杂性意味着它们可能永远无法解决。但是我们有时可以预测在什么条件下存在解决方案。计算机科学家在开发快速算法方面非常成功:例如,谷歌在不到一秒钟的时间内搜索了超过80亿个网页的索引。索引搜索问题被认为是“易处理的”或有效解决的。甚至有可能保证,无论您搜索什么关键字,都将迅速获得答案。这样最坏的效率保证是算法设计的金标准。但不幸的是,这种保证并非总是可能的:对于许多计算问题,我们要么证明不存在有效的算法,要么我们有充分的证据表明这种算法不太可能存在(Achlioptas等人,第759页)提供了对一类计算难题的一系列严格见解-称为约束满足问题-发生在航空和火车机组的日程安排,数据挖掘,软件设计和计算生物学等各个领域。

著录项

  • 来源
    《Nature》 |2005年第7043期|p.751-752|共2页
  • 作者

    Carla P. Gomes; Bart Selman;

  • 作者单位
  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);美国《生物学医学文摘》(MEDLINE);美国《化学文摘》(CA);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自然科学总论;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号