首页> 外国专利> Method and computing device for solving NP problems without hyperpolynomial cost

Method and computing device for solving NP problems without hyperpolynomial cost

机译:一种无需多项式代价即可解决np问题的方法及计算装置

摘要

Within satisfaction problems or any decision or other problem which is reducible to a satisfaction problem, the invention tracks the paths along which implications propagate and identifies conditional contradictions and subsequently moves the contradictions back down the implicational paths toward assumptions or other unreasoned assertions in order to expel the contradictions. The action is completed in less time than is incurred by existing methods and thus provides a performance improvement to the devices, software, or processes which address such problems. Such problems are addressed by devices, software, and processes related to many technical fields, including: ore refining; pipeline routing; yarn manufacture; fabric cutting; sawyering; mechanical component design; structural design of data processing systems; design and analysis of circuits or semiconductor masks; inspection and guarding of containers, pipes, and galleries; sensor array operations; orbital satellite operations; data compression; chemical analysis; design and analysis of proteins.
机译:在满意度问题或可简化为满意度问题的任何决策或其他问题中,本发明跟踪暗示传播的路径并识别条件矛盾,然后将矛盾沿着暗示路径向下移向假设或其他不合理的断言以驱逐矛盾。该动作的完成时间少于现有方法所花费的时间,因此可为解决此类问题的设备,软件或过程提供性能改进。这些问题可以通过与许多技术领域相关的设备,软件和过程来解决,这些领域包括:矿石精炼;管道布线;纱线制造;面料切割锯切机械零件设计;数据处理系统的结构设计;电路或半导体掩膜的设计和分析;检查和保护容器,管道和画廊;传感器阵列操作;轨道卫星运行;数据压缩化学分析;蛋白质的设计和分析。

著录项

  • 公开/公告号JP6550384B2

    专利类型

  • 公开/公告日2019-07-24

    原文格式PDF

  • 申请/专利权人 ジリスピー;クレイトン;

    申请/专利号JP20160526262

  • 发明设计人 ジリスピー;クレイトン;

    申请日2015-03-25

  • 分类号G06N99;G06F17/10;

  • 国家 JP

  • 入库时间 2022-08-21 12:20:23

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号