会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Linear-program formulation for optimizing inventory allocation
    • 线性程序制定,用于优化库存分配
    • US08155990B2
    • 2012-04-10
    • US12359932
    • 2009-01-26
    • David Max ChickeringManan SanghiAshis RoyRobert Paul GormanIzzet Can Envarli
    • David Max ChickeringManan SanghiAshis RoyRobert Paul GormanIzzet Can Envarli
    • G06F17/50G06F9/44
    • G06Q30/02G06Q10/0631G06Q10/087G06Q30/0201G06Q30/0241G06Q30/0269
    • Computer-readable media for determining whether to accept a candidate order from a content provider, or advertiser, to display a particular number of advertisements within a specified time segment are provided. Initially, the content provider may include placement criteria that, among other things, identify a leaf node at which impressions of the advertisement are expected to be rendered. Generally, the leaf node refers to a location within a topic graph that describes inventory that is permissible to allocate to satisfy the candidate order. To perform the determination, the inventory of impressions available for accommodating the candidate order and a log of booked orders scheduled to be placed within the time segment are identified. Linear programs are then utilized to determine whether the estimated inventory that satisfies the placement criteria is available by predictively placing the booked orders at the estimated inventory. If estimated inventory remains available, the candidate order is accepted.
    • 提供了用于确定是否接受来自内容提供商或广告商的候选订单以在指定时间段内显示特定数量的广告的计算机可读介质。 最初,内容提供商可以包括放置标准,其中除了别的以外,还标识预期要呈现广告的展示的叶节点。 通常,叶节点是指主题图中描述可以分配以满足候选顺序的库存的位置。 为了执行确定,识别可用于容纳候选订单的可用印象的库存以及计划放置在时间段内的已预订订单的日志。 然后利用线性方案来确定满足放置标准的估计库存是否可通过将预定订单预测放在估计库存中来获得。 如果估计的库存仍然可用,则接受订单。
    • 9. 发明申请
    • LINEAR-PROGRAM FORMULATION FOR OPTIMIZING INVENTORY ALLOCATION
    • 线性程序配方优化库存分配
    • US20100191558A1
    • 2010-07-29
    • US12359932
    • 2009-01-26
    • DAVID MAX CHICKERINGMANAN SANGHIASHIS ROYROBERT PAUL GORMANIZZET CAN ENVARLI
    • DAVID MAX CHICKERINGMANAN SANGHIASHIS ROYROBERT PAUL GORMANIZZET CAN ENVARLI
    • G06Q10/00G06Q30/00
    • G06Q30/02G06Q10/0631G06Q10/087G06Q30/0201G06Q30/0241G06Q30/0269
    • Computer-readable media for determining whether to accept a candidate order from a content provider, or advertiser, to display a particular number of advertisements within a specified time segment are provided. Initially, the content provider may include placement criteria that, among other things, identify a leaf node at which impressions of the advertisement are expected to be rendered. Generally, the leaf node refers to a location within a topic graph that describes inventory that is permissible to allocate to satisfy the candidate order. To perform the determination, the inventory of impressions available for accommodating the candidate order and a log of booked orders scheduled to be placed within the time segment are identified. Linear programs are then utilized to determine whether the estimated inventory that satisfies the placement criteria is available by predictively placing the booked orders at the estimated inventory. If estimated inventory remains available, the candidate order is accepted.
    • 提供了用于确定是否接受来自内容提供商或广告商的候选订单以在指定时间段内显示特定数量的广告的计算机可读介质。 最初,内容提供商可以包括放置标准,其中除了别的以外,还标识预期要呈现广告的展示的叶节点。 通常,叶节点是指主题图中描述可以分配以满足候选顺序的库存的位置。 为了执行确定,识别可用于容纳候选订单的可用印象的库存以及计划放置在时间段内的已预订订单的日志。 然后利用线性方案来确定满足放置标准的估计库存是否可通过将预定订单预测放在估计库存中来获得。 如果估计的库存仍然可用,则接受订单。