知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

11 records (took 0.014 seconds)

    Priority-based search for combinatorial optimization problems
    1.
    发明申请
    Priority-based search for combinatorial optimization problems 审中-公开
    基于优先级的组合优化问题搜索

    公开(公告)号：US20050033731A1

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

    申请号：US10634280

    申请日：2003-08-05

    Applicant: Neal Lesh ,  Michael Mitzenmacher

    Inventor： Neal Lesh ,  Michael Mitzenmacher

    IPC: G06F19/00 ,  G06Q10/00 ,  G06F7/00

    CPC classification number: G06Q10/04

    Abstract: A method solves a combinatorial optimization problem including multiple elements and values. An ordering function is applied to an instance of the combinatorial optimization problem to produce an ordering of elements. The ordering of the elements is modified repeatedly to produce a re-ordering of the elements. A placement function is applied to each re-ordering of the elements to obtain solutions of the combinatorial optimization problem, until a termination condition is reached, and a best solution is selected.

    Abstract translation: 一种方法解决包括多个元素和值的组合优化问题。 排序函数被应用于组合优化问题的实例以产生元素的排序。 重复修改元素的顺序以产生元素的重新排序。 将一个放置函数应用于元素的每个重新排序以获得组合优化问题的解决方案，直到达到终止条件，并且选择最佳解决方案。

    Task processing optimization in a multiprocessor system
    2.
    发明授权
    Task processing optimization in a multiprocessor system 失效
    多处理器系统中的任务处理优化

    公开(公告)号：US5991808A

    公开(公告)日：1999-11-23

    申请号：US867095

    申请日：1997-06-02

    Applicant: Andrei Broder ,  Michael Mitzenmacher

    Inventor： Andrei Broder ,  Michael Mitzenmacher

    IPC: G06F9/50 ,  G06F15/16

    CPC classification number: G06F9/505

    Abstract: A method of operating a multiprocessor system having a predefined number of processing units for processing data, includes obtaining load information representing a loading of each of a number of randomly selected ones of the processing units. The number of randomly selected processing units is greater than 1 and substantially less than the predefined number of processing units. A least loaded of the randomly selected processing units is identified from the obtained load information. The data is directed to the identified least loaded randomly selected processing unit for processing.

    Abstract translation: 一种操作具有用于处理数据的预定数量的处理单元的多处理器系统的方法，包括获得表示所述处理单元中随机选择的多个处理单元中的每一个的负载的负载信息。 随机选择的处理单元的数量大于1并且基本上小于预定数量的处理单元。 从获得的负载信息中识别出随机选择的处理单元的最少装载量。 数据被引导到所识别的最少加载的随机选择的处理单元进行处理。

    System and method for near-uniform sampling of web page addresses
    3.
    发明授权
    System and method for near-uniform sampling of web page addresses 失效
    网页地址近似均匀采样的系统和方法

    公开(公告)号：US06594694B1

    公开(公告)日：2003-07-15

    申请号：US09570418

    申请日：2000-05-12

    Applicant: Marc Alexander Najork ,  Clark Allan Heydon ,  Michael Mitzenmacher ,  Monika H. Henzinger

    Inventor： Marc Alexander Najork ,  Clark Allan Heydon ,  Michael Mitzenmacher ,  Monika H. Henzinger

    IPC: G06F1516

    CPC classification number: G06F17/30873

    Abstract: A system generates a list of near-uniform samples of data sets (e.g., web pages) from among a plurality of host computers. The system performs a random walk so as to generate a set of visited addresses. For each address in the set, a reachability measure is computed. Then, samples are selected from the set, such that the probability of selecting a given address is inversely proportional to the reachability measure for the address. The selected samples form the list of near-uniform samples.

    Abstract translation: 系统从多个主计算机生成数据集（例如，网页）的近似均匀样本的列表。 系统执行随机游走，以便产生一组访问地址。 对于集合中的每个地址，计算可达性度量。 然后，从集合中选择样本，使得选择给定地址的概率与地址的可达性度量成反比。 所选样品形成近均匀样品的列表。

    Generating high weight encoding symbols using a basis
    4.
    发明授权
    Generating high weight encoding symbols using a basis 有权
    使用基础生成高权重编码符号

    公开(公告)号：US06411223B1

    公开(公告)日：2002-06-25

    申请号：US09691735

    申请日：2000-10-18

    Applicant: Armin Haken ,  Michael G. Luby ,  Gavin Horn ,  Diane Hernek ,  John Byers ,  Michael Mitzenmacher

    Inventor： Armin Haken ,  Michael G. Luby ,  Gavin Horn ,  Diane Hernek ,  John Byers ,  Michael Mitzenmacher

    IPC: H03M700

    CPC classification number: H03M7/00 ,  H04L1/0041

    Abstract: Output symbols are generated using input symbols and basis elements. A plurality of basis elements are generated. Each basis element is generated from a predetermined function of associated input symbols associated with the basis element. For each output symbol, a set of associated basis elements associated with the output symbol is determined, and a set of direct associated input symbols directly associated with the output symbol is determined. For each output symbol, the output symbol is generated from a predetermined function of the associated basis elements and the associated input symbols.

    Abstract translation: 使用输入符号和基元生成输出符号。 产生多个基元。 每个基元从与基元相关联的关联输入符号的预定函数生成。 对于每个输出符号，确定与输出符号相关联的一组相关联的基元，并且确定与输出符号直接相关联的一组直接相关联的输入符号。 对于每个输出符号，从相关联的基元和相关联的输入符号的预定函数生成输出符号。

    Intelligent data summarization and visualization
    5.
    发明申请
    Intelligent data summarization and visualization 审中-公开
    智能数据汇总和可视化

    公开(公告)号：US20050262057A1

    公开(公告)日：2005-11-24

    申请号：US10852628

    申请日：2004-05-24

    Applicant: Neal Lesh ,  Michael Mitzenmacher

    Inventor： Neal Lesh ,  Michael Mitzenmacher

    IPC: G06F17/30 ,  G06F7/00

    CPC classification number: G06F16/345 ,  G06F16/93

    Abstract: A query for a database is represented as a vector including multiple elements. Each element is a control, and each control has a current setting. The database is queried with the query to produce a current synopsis. The current synopsis is added to a current summary. The current synopsis and the current controls and a current summary including the current synopsis are visualized on a graphical user interface. A new setting for the controls is indicated to produce a new synopsis that when added to the current summary makes a next summary most different than the current summary. The querying, visualizing, and indicating until a termination condition is reached to generate a most interesting summary of the database.

    Abstract translation: 对数据库的查询表示为包含多个元素的向量。 每个元素都是一个控件，每个控件都有一个当前设置。 查询数据库以产生当前的概要。 当前的摘要将添加到当前的摘要中。 当前的概要和当前的控件以及包括当前概要的当前摘要在图形用户界面上可视化。 指示控件的新设置产生一个新的概要，当添加到当前摘要中时，下一个摘要与当前摘要最不同。 查询，可视化和指示，直到达到终止条件，以生成数据库最有趣的摘要。

    METHOD FOR FINDING OPTIMAL PATHS USING A STOCHASTIC NETWORK MODEL
    7.
    发明申请
    METHOD FOR FINDING OPTIMAL PATHS USING A STOCHASTIC NETWORK MODEL 有权
    使用STOCHASTIC网络模型寻找最佳方法的方法

    公开(公告)号：US20090175171A1

    公开(公告)日：2009-07-09

    申请号：US11512849

    申请日：2006-08-30

    Applicant: Evdokia V. Nikolova ,  Matthew E. Brand ,  Michael Mitzenmacher

    Inventor： Evdokia V. Nikolova ,  Matthew E. Brand ,  Michael Mitzenmacher

    IPC: H04J3/14

    CPC classification number: H04L45/12 ,  H04L45/121 ,  H04L45/122 ,  H04L45/14

    Abstract: 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.

    Abstract translation: 一种方法找到从源到目标的最佳路径。 从源到目的地的可能路径被表示为通过边连接的节点的随机图。 每个边缘在边缘成本上具有独立的概率分布。 定义到达目的地的约束。 该图被减少到相对小的一组确定性最小成本问题，其可以被解决以确定最大化在约束内到达目的地的概率的最优路径。

    Method for finding optimal paths using a stochastic network model
    10.
    发明授权
    Method for finding optimal paths using a stochastic network model 有权
    使用随机网络模型寻找最优路径的方法

    公开(公告)号：US07573866B2

    公开(公告)日：2009-08-11

    申请号：US11512849

    申请日：2006-08-30

    Applicant: Evdokia V. Nikolova ,  Matthew E. Brand ,  Michael Mitzenmacher

    Inventor： Evdokia V. Nikolova ,  Matthew E. Brand ,  Michael Mitzenmacher

    IPC: H04L12/28

    CPC classification number: H04L45/12 ,  H04L45/121 ,  H04L45/122 ,  H04L45/14

    Abstract: 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.

    Abstract translation: 一种方法找到从源到目标的最佳路径。 从源到目的地的可能路径表示为通过边连接的节点的随机图。 每个边缘在边缘成本上具有独立的概率分布。 定义到达目的地的约束。 该图被减少到相对小的一组确定性最小成本问题，其可以被解决以确定最大化在约束内到达目的地的概率的最优路径。

Patent Agency Ranking