-
公开(公告)号：US07756021B2
公开(公告)日：2010-07-13
申请号：US11493198
申请日：2006-07-26
CPC分类号： H04L45/12 , H04L45/121
摘要： A computer implemented method finds a path having a minimal expected cost through a network of nodes connected by arcs, in which the path is from a source node to a destination node, and in which a traversal time for traversing each arc is a random variable. An expected cost of traversing each possible path from the source node to the destination node is determined as an average value of a nonlinear cost function applied to each possible total travel time for traversing the path. The expected cost is weighted according to a probability of each possible total travel time. For each node in the network and for each possible time to start, a particular path from the source node to the node having a minimal expected cost and an optimal time to start on that path is determined.
摘要翻译： 计算机实现的方法通过由弧连接的节点网络找到具有最小预期成本的路径，其中路径从源节点到目的地节点，并且其中遍历每个弧的遍历时间是随机变量。 将从源节点到目的地节点的每个可能路径的预期成本确定为应用于遍历路径的每个可能的总行进时间的非线性成本函数的平均值。 预期成本根据每个可能的总旅行时间的概率加权。 对于网络中的每个节点以及每个可能的时间开始，确定从源节点到具有最小预期成本的节点和在该路径上开始的最佳时间的特定路径。
-
公开(公告)号：US07573866B2
公开(公告)日：2009-08-11
申请号：US11512849
申请日：2006-08-30
IPC分类号： H04L12/28
CPC分类号： H04L45/12 , H04L45/121 , H04L45/122 , H04L45/14
摘要： A method finds an optimal path from a source to a destination. The possible paths from the source to the destination are represented as a stochastic graph of nodes connected by edges. Each edge has an independent probability distribution over a cost of the edge. A constraint for reaching the destination is defined. The graph is reduced to a relatively small set of deterministic minimum cost problems, which can be solved to determine an optimal path that maximizes a probability of reaching the destination within the constraint.
摘要翻译： 一种方法找到从源到目标的最佳路径。 从源到目的地的可能路径表示为通过边连接的节点的随机图。 每个边缘在边缘成本上具有独立的概率分布。 定义到达目的地的约束。 该图被减少到相对小的一组确定性最小成本问题，其可以被解决以确定最大化在约束内到达目的地的概率的最优路径。
-
3.发明申请公开(公告)号：US20090175171A1
公开(公告)日：2009-07-09
申请号：US11512849
申请日：2006-08-30
IPC分类号： H04J3/14
CPC分类号： H04L45/12 , H04L45/121 , H04L45/122 , H04L45/14
摘要： A method finds an optimal path from a source to a destination. The possible paths from the source to the destination are represented as a stochastic graph of nodes connected by edges. Each edge has an independent probability distribution over a cost of the edge. A constraint for reaching the destination is defined. The graph is reduced to a relatively small set of deterministic minimum cost problems, which can be solved to determine an optimal path that maximizes a probability of reaching the destination within the constraint.
摘要翻译： 一种方法找到从源到目标的最佳路径。 从源到目的地的可能路径被表示为通过边连接的节点的随机图。 每个边缘在边缘成本上具有独立的概率分布。 定义到达目的地的约束。 该图被减少到相对小的一组确定性最小成本问题，其可以被解决以确定最大化在约束内到达目的地的概率的最优路径。
-
公开(公告)号：US20080025222A1
公开(公告)日：2008-01-31
申请号：US11493198
申请日：2006-07-26
CPC分类号： H04L45/12 , H04L45/121
摘要： A computer implemented method finds a path having a minimal expected cost through a network of nodes connected by arcs, in which the path is from a source node to a destination node, and in which a traversal time for traversing each arc is a random variable. An expected cost of traversing each possible path from the source node to the destination node is determined as an average value of a nonlinear cost function applied to each possible total travel time for traversing the path. The expected cost is weighted according to a probability of each possible total travel time. For each node in the network and for each possible time to start, a particular path from the source node to the node having a minimal expected cost and an optimal time to start on that path is determined.
摘要翻译： 计算机实现的方法通过由弧连接的节点网络找到具有最小预期成本的路径，其中路径从源节点到目的地节点，并且其中遍历每个弧的遍历时间是随机变量。 将从源节点到目的地节点的每个可能路径的预期成本确定为应用于遍历路径的每个可能的总行进时间的非线性成本函数的平均值。 预期成本根据每个可能的总旅行时间的概率加权。 对于网络中的每个节点以及每个可能的时间开始，确定从源节点到具有最小预期成本的节点和在该路径上开始的最佳时间的特定路径。
-
公开(公告)号：US08335718B2
公开(公告)日：2012-12-18
申请号：US12197726
申请日：2008-08-25
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0275 , G06Q40/00
摘要： Content item presentation slots (e.g., advertisement slots) can be grouped into a slot group so that more than one presenter (e.g., advertiser) can share a corresponding number of slots on the publisher's property over a defined time period. The presenters can be scheduled to the slots within the slot group to maximize a performance measurement (e.g., number of clicks) that each presenter realizes according to budget constraints that are defined by the presenters.
摘要翻译： 内容项目呈现时隙（例如，广告时隙）可以被分组为时隙组，使得多于一个演示者（例如，广告商）可以在定义的时间段上共享发布者的属性上的相应数量的时隙。 可以将演示者调度到时隙组内的时隙，以最大限度地提高每个演示者根据由演示者定义的预算限制实现的性能测量（例如，点击次数）。
-
公开(公告)号：US20100049644A1
公开(公告)日：2010-02-25
申请号：US12197726
申请日：2008-08-25
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0275 , G06Q40/00
摘要： Content item presentation slots (e.g., advertisement slots) can be grouped into a slot group so that more than one presenter (e.g., advertiser) can share a corresponding number of slots on the publisher's property over a defined time period. The presenters can be scheduled to the slots within the slot group to maximize a performance measurement (e.g., number of clicks) that each presenter realizes according to budget constraints that are defined by the presenters.
摘要翻译： 内容项目呈现时隙（例如，广告时隙）可以被分组为时隙组，使得多于一个演示者（例如，广告商）可以在定义的时间段上共享发布者的属性上的相应数量的时隙。 可以将演示者调度到时隙组内的时隙，以最大限度地提高每个演示者根据由演示者定义的预算限制实现的性能测量（例如，点击次数）。
-
-
-
-
-
搜索结果
6 条记录 (耗时 0.047 秒)
