Invention Grant
- Patent Title: Bounded sub-optimal problem solving
- Patent Title (中): 有界次优解决问题
-
Application No.: US11948265Application Date: 2007-11-30
-
Publication No.: US07966336B2Publication Date: 2011-06-21
- Inventor: Wheeler Ruml
- Applicant: Wheeler Ruml
- Applicant Address: US CA Palo Alto
- Assignee: Palo Alto Research Center Incorporated
- Current Assignee: Palo Alto Research Center Incorporated
- Current Assignee Address: US CA Palo Alto
- Agency: Fay Sharpe LLP
- Main IPC: G06F7/00
- IPC: G06F7/00

Abstract:
A data structure is described that comprises a balanced binary tree and a binary heap, which may be utilized for combinatorial searching algorithms. For instance, solutions for performing a task, such as a print job or the like, are associated with nodes that are utilized to generate the data structure. Each node is associated with a quality indicator that describes a most optimal solution that may be reached through the node when traversing the binary tree. The binary heap is generated from a subset of the nodes in the tree, wherein each node in the subset has a quality indicator value that is within a predefined range of a best known solution quality. The binary heap is sorted according to a search effort indicator value for each node, where nodes that are more easily reached in the tree are placed higher in the heap to facilitate rapid identification.
Public/Granted literature
- US20090144310A1 BOUNDED SUB-OPTIMAL PROBLEM SOLVING Public/Granted day:2009-06-04
Information query