利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

7 条记录 (耗时 0.014 秒)

    Decision logic comparison and review
    2.
    发明授权
    Decision logic comparison and review 有权
    决策逻辑比较和审查

    公开(公告)号：US08200693B2

    公开(公告)日：2012-06-12

    申请号：US12493010

    申请日：2009-06-26

    申请人： Michael Steele ,  Stuart Crawford ,  Navin Doshi ,  Kashyap Babu Rao Kolipaka ,  Prasun Kumar ,  Sergei Tolmanov

    发明人： Michael Steele ,  Stuart Crawford ,  Navin Doshi ,  Kashyap Babu Rao Kolipaka ,  Prasun Kumar ,  Sergei Tolmanov

    IPC分类号： G06F17/00

    CPC分类号： G06F7/02

    摘要： Techniques are described for logically comparing strategies. In one aspect the strategies can be compared by receiving a request to compare a first strategy to a second strategy, the first strategy graphically represented by a first set of linked nodes, the second strategy graphically represented by a second set of linked nodes, each set of linked nodes linking a root node to at least one action node; identifying a subset of linked nodes from at least one of the first set of linked nodes and the second set of linked nodes based on an equivalence of a first subset of the first set of linked nodes to a second subset of the second set of linked nodes; and, providing a visual depiction of the identified subset of the linked nodes to a user, the visual depiction corresponding to the equivalence of the first subset to the second subset.

    摘要翻译： 描述了用于逻辑比较策略的技术。 在一个方面，可以通过接收将第一策略与第二策略进行比较的请求来比较策略，由第一组链接节点图形表示的第一策略，由第二组链接节点图形表示的第二策略，每组 链接节点将根节点链接到至少一个动作节点; 基于所述第一组链接节点的第一子集与所述第二组链接节点的第二子集的等同性，从所述第一组链接节点和所述第二组链接节点中的至少一个标识链接节点的子集 ; 以及向所述用户提供所确定的所述链接节点的子集的视觉描述，所述视觉描述对应于所述第一子集与所述第二子集的等价。

    Converting unordered graphs to oblivious read once ordered graph representation
    3.
    发明授权
    Converting unordered graphs to oblivious read once ordered graph representation 有权
    将无序图转换为遗忘读取一次有序图表示

    公开(公告)号：US08280836B2

    公开(公告)日：2012-10-02

    申请号：US12206514

    申请日：2008-09-08

    申请人： Prasun Kumar

    发明人： Prasun Kumar

    IPC分类号： G06F17/00 ,  G06N5/02

    CPC分类号： G06N5/02

    摘要： Data characterizing a desired variable order and an unordered graph can be received so that all paths in the unordered graph can be enumerated and a first path in the unordered graph can be leveled according to the desired variable order in a first oblivious read once decision graph. For each additional path other than the first path, the additional path is leveled in the desired order, nodes of the additional path are added to the first oblivious read once decision graph, and a union operation is performed on the first oblivious read once decision graph to union graph roots on the first oblivious read once decision graph. Thereafter, generation of a second oblivious read once decision graph can be initiated after completing processing of the first path and each additional path. Related apparatus, systems, techniques and articles are also described.

    摘要翻译： 可以接收表征期望的变量顺序和无序图的数据，使得可以枚举无序图中的所有路径，并且可以根据在第一个不明朗的一次读取决策图中的期望的变量顺序对无序图中的第一路径进行调整。 对于除第一路径之外的每个附加路径，附加路径按所需的顺序调平，附加路径的节点被添加到第一个无声读取一次决策图，并且对第一个遗忘的一次读取决策图执行联合操作 根据第一次无知的一次决策图的联合图形根。 此后，在完成第一路径和每个附加路径的处理之后，可以启动生成第二个不明朗的一次性决定图。 还描述了相关设备，系统，技术和物品。

    CONVERTING UNORDERED GRAPHS TO OBLIVIOUS READ ONCE ORDERED GRAPH REPRESENTATION
    4.
    发明申请
    CONVERTING UNORDERED GRAPHS TO OBLIVIOUS READ ONCE ORDERED GRAPH REPRESENTATION 有权
    将不正确的图形转换为无效的阅读一般订单的图表表示

    公开(公告)号：US20100063953A1

    公开(公告)日：2010-03-11

    申请号：US12206514

    申请日：2008-09-08

    申请人： PRASUN KUMAR

    发明人： PRASUN KUMAR

    IPC分类号： G06N5/02

    CPC分类号： G06N5/02

    摘要： Data characterizing a desired variable order and an unordered graph can be received so that all paths in the unordered graph can be enumerated and a first path in the unordered graph can be leveled according to the desired variable order in a first oblivious read once decision graph. For each additional path other than the first path, the additional path is leveled in the desired order, nodes of the additional path are added to the first oblivious read once decision graph, and a union operation is performed on the first oblivious read once decision graph to union graph roots on the first oblivious read once decision graph. Thereafter, generation of a second oblivious read once decision graph can be initiated after completing processing of the first path and each additional path. Related apparatus, systems, techniques and articles are also described.

    摘要翻译： 可以接收表征期望的变量顺序和无序图的数据，使得可以枚举无序图中的所有路径，并且可以根据在第一个不明朗的一次读取决策图中的期望的变量顺序对无序图中的第一路径进行调整。 对于除第一路径之外的每个附加路径，附加路径按所需的顺序调平，附加路径的节点被添加到第一个无声读取一次决策图，并且对第一个遗忘的一次读取决策图执行联合操作 根据第一次无知的一次决策图的联合图形根。 此后，在完成第一路径和每个附加路径的处理之后，可以启动生成第二个不明朗的一次性决定图。 还描述了相关设备，系统，技术和物品。

    DECISION LOGIC COMPARISON AND REVIEW
    5.
    发明申请
    DECISION LOGIC COMPARISON AND REVIEW 有权
    决策逻辑比较与评估

    公开(公告)号：US20100332514A1

    公开(公告)日：2010-12-30

    申请号：US12493010

    申请日：2009-06-26

    申请人： Michael Steele ,  Stuart Crawford ,  Navin Doshi ,  Kashyap Babu Rao Kolipaka ,  Prasun Kumar ,  Sergei Tolmanov

    发明人： Michael Steele ,  Stuart Crawford ,  Navin Doshi ,  Kashyap Babu Rao Kolipaka ,  Prasun Kumar ,  Sergei Tolmanov

    IPC分类号： G06F7/14 ,  G06F17/30 ,  G06F3/048 ,  G06F7/20

    CPC分类号： G06F7/02

    摘要： Techniques are described for logically comparing strategies. In one aspect the strategies can be compared by receiving a request to compare a first strategy to a second strategy, the first strategy graphically represented by a first set of linked nodes, the second strategy graphically represented by a second set of linked nodes, each set of linked nodes linking a root node to at least one action node; identifying a subset of linked nodes from at least one of the first set of linked nodes and the second set of linked nodes based on an equivalence of a first subset of the first set of linked nodes to a second subset of the second set of linked nodes; and, providing a visual depiction of the identified subset of the linked nodes to a user, the visual depiction corresponding to the equivalence of the first subset to the second subset.

    摘要翻译： 描述了用于逻辑比较策略的技术。 在一个方面，可以通过接收将第一策略与第二策略进行比较的请求来比较策略，由第一组链接节点图形表示的第一策略，由第二组链接节点图形表示的第二策略，每组 链接节点将根节点链接到至少一个动作节点; 基于所述第一组链接节点的第一子集与所述第二组链接节点的第二子集的等同性，从所述第一组链接节点和所述第二组链接节点中的至少一个标识链接节点的子集 ; 以及向所述用户提供所确定的所述链接节点的子集的视觉描述，所述视觉描述对应于所述第一子集与所述第二子集的等价。