-
公开(公告)号：US5734592A
公开(公告)日：1998-03-31
申请号：US502224
申请日：1995-07-13
CPC分类号： G06K9/6892 , G06F17/10 , G06Q10/04
摘要： A computer-implemented process for determining a ranked set of solutions to a bipartite graph matching problem, such is involved in multi-target tracking, maximum flow matching, or data association in matching elements of a first set to elements of a second set to minimize the cost of the association. A feature of the process is a partitioning into subproblems such that the most probable solutions are in the smaller subproblems and the computation begins by solving the smallest subproblem in the search for the best solution.
摘要翻译： 用于确定二分图匹配问题的排列的解决方案的计算机实现的过程，诸如在第一组与第二组的元素的匹配元素中的多目标跟踪，最大流匹配或数据关联中涉及以最小化 协会的费用。 该过程的一个特征是将子问题分解成最可能的解决方案在较小的子问题中，并且计算开始于寻找最佳解决方案中最小的子问题。
-
公开(公告)号：US5611070A
公开(公告)日：1997-03-11
申请号：US149139
申请日：1993-10-13
CPC分类号： G06F12/0833 , G06F12/0862
摘要： A Write/Load cache protocol is described which may be used for maintaining cache coherency and performing barrier synchronization in multiprocessor computer systems, and for cooperating with prefetch mechanisms to allow data to be loaded into a central processor unit's (CPU) cache (in both single and multiprocessor systems) in anticipation of future memory references. The new protocol is defined such that when a cache observes a Write/Load command (and associated data item) on a bus to which the cache is attached, the cache is accessed and (a) if the data item is in the cache, the new value of the data item from the bus is copied into and replaces the data item in cache; and (b) if the data item is not in the cache, a new data item is created therein (preferably using the normal cache replacement policy), and the value of the data item on the bus is loaded into the cache. Thus, a protocol is provided which allows cache to be loaded via an external entity, i.e., other than the processor being directly serviced by the cache.
摘要翻译： 描述了可以用于维护高速缓存一致性并在多处理器计算机系统中执行屏障同步的写入/加载缓存协议，并且与预取机制配合以允许将数据加载到中央处理器单元的（CPU）高速缓存中 和多处理器系统），以期将来的内存引用。 定义新协议，使得当高速缓存在缓存附加到的总线上观察到写/加载命令（和相关联的数据项）时，高速缓存被访问，并且（a）如果数据项在高速缓存中，则 来自总线的数据项的新值被复制到高速缓存中并替换该数据项; 和（b）如果数据项不在高速缓存中，则在其中创建新的数据项（优选地使用正常的高速缓存替换策略），并且将总线上的数据项的值加载到高速缓存中。 因此，提供了允许经由外部实体加载高速缓存的协议，即除了由高速缓存直接服务的处理器之外的缓存。
-
公开(公告)号：US5093890A
公开(公告)日：1992-03-03
申请号：US618768
申请日：1990-11-27
CPC分类号： G02B6/43 , G02B6/2817
摘要： An optical bus for interconnecting electronic devices. The bus has a substrate with through-holes therein. An optically conductive material is disposed on one side of the substrate. The material fills the through-holes and forms a layer of predetermined thickness on this side of the substrate. In the outer surface of this layer there are facets or angled regions. The surface and facets are optically reflective. Cards or modules are optically connected by means of optical connectors to the through-holes on the opposite side of the substrate. Light emitted by the connector travels to the associated faceted surface from which it reflects towards other faceted surfaces from which it is partially transmitted and partially reflected to another connector. The arrangement permits optical communication between a plurality of electronic devices.
-
公开(公告)号：US5065310A
公开(公告)日：1991-11-12
申请号：US349621
申请日：1989-05-10
申请人： Harold S. Stone
发明人： Harold S. Stone
CPC分类号： G06F12/128 , G06F12/0842
摘要： Suspensions of programs running in a multi-programming environment are made to occur when the footprint of a program to be suspended is relatively small. This occurs when a process releases data or instruction storage in the cache because the program has moved to a different phase of behavior. An interrupt is armed to occur at small-footprint points, and then the point where that occurs is detected.
-
公开(公告)号：US4843567A
公开(公告)日：1989-06-27
申请号：US79721
申请日：1987-07-30
CPC分类号： G06N5/003 , Y10S706/908
摘要： A system for the adaptive reordering of sequential decisions in the search of a data base is provided with a device that simplifies and speeds up a heuristic search method by implementing in hardware the computation required for the adaptive reordering. The system includes an arithmetic unit for computing for each decision the ratio p/c where p is the probability of a successful outcome of the decision and c is the cost of computation to make that decision. The arithmetic unit includes a device for estimating the logarithms of the prabability p and the cost c for each decision. Logarithms of ratios p/c are calculated for each decision by subtracting the log c from the log p, and then the logarithms of the ratios for the decisions are compared to produce a priority value for each decision. The decisions are reordered based on the priority value assigned to each decision to obtain the optimal ordering of the decisions.
-
公开(公告)号：US4752890A
公开(公告)日：1988-06-21
申请号：US885101
申请日：1986-07-14
IPC分类号： G06F9/44 , G06F15/18 , G06F17/30 , G06N3/00 , G06N5/00 , G06N5/04 , G06N99/00 , G06F15/46 , G06K9/62
CPC分类号： G06N5/04 , G06N5/003 , Y10S706/908 , Y10S706/922
摘要： An adaptive mechanism is presented in the context of optimization of expert system applications. Both single and multiple processor implementations are disclosed. The mechanism is used to maintain a near-optimal sequence for scanning rule lists in expert systems. For a program containing a sequential-decision chain with many independent or mutually exclusive outcomes with each decision having associated with it some fixed cost and probability, the adaptive mechanism tends to produce the optimal ordering automatically from repeated observations of the execution of the decision chain.
摘要翻译： 在专家系统应用优化的背景下提出了一种适应机制。 公开了单处理器和多处理器实现。 该机制用于维护专家系统中扫描规则列表的近似最佳顺序。 对于包含具有许多独立或互斥结果的顺序决策链的程序，每个决定与其相关联具有固定的成本和概率，所以自适应机制倾向于从对决策链的执行的反复观察中自动产生最佳排序。
-
-
-
-
-
搜索结果
16 条记录 (耗时 0.031 秒)
