会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 9. 发明授权
    • Scalar code reduction using shortest path routing
    • 使用最短路径路由的标量代码减少
    • US08413126B2
    • 2013-04-02
    • US11763990
    • 2007-06-15
    • James C. Beyer
    • James C. Beyer
    • G06F9/45
    • G06F8/4441
    • This document discusses, among other things, a system and method computing the shortest path expression in a loop having a plurality of expressions. Candidate expressions in the loop are identified and partitioned into sets. A cost matrix is computed as a function of the sets. Paths are found through the cost matrix and, if there are cycles in the paths, the cycles are broken. One or more shortest path expressions are generated as a function of the paths and one or more of the expressions in the loop are replaced with the shortest path expressions.
    • 该文件尤其涉及一种在具有多个表达式的循环中计算最短路径表达式的系统和方法。 循环中的候选表达式被识别并分割成集合。 作为集合的函数计算成本矩阵。 通过成本矩阵找到路径,如果路径中有循环,则循环被破坏。 作为路径的函数生成一个或多个最短路径表达式,并且循环中的一个或多个表达式被最短路径表达式替换。