Bounded sub-optimal problem solving

Details Bounded sub-optimal problem solving Bounded sub-optimal problem solving

2011-06-21

2011-06-21

Robinson, Greta L (Department: 2169)

Data processing: database and file management or data structures

Database and file access

Preparing data for information retrieval

Reexamination Certificate

active

07966336

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.

REFERENCES:
patent: 5646740 (1997-07-01), Webster et al.
patent: 6959165 (2005-10-01), Mandel et al.
patent: 6973286 (2005-12-01), Mandel et al.
patent: 2006/0031802 (2006-02-01), Alpert et al.
patent: 2006/0132815 (2006-06-01), Lofthus et al.
patent: 2006/0227350 (2006-10-01), Crawford et al.
patent: 2006/0230201 (2006-10-01), Fromherz et al.
patent: 2006/0230403 (2006-10-01), Crawford et al.
patent: 2006/0235547 (2006-10-01), Hindi et al.
patent: 2007/0091797 (2007-04-01), Ma et al.
Khoong et al., Double-Ended Binomial Queues, Proceedings of the 4th International Symposium on Algorithms and Computations, vol. 762, pp. 128-137 (Publushed 1993).
Dae-Wha Seo et al., “Directory-Based Cache Coherence Scheme using Number-Balanced Binary Tree” Microprocessing and Microprogramming, Elsevier Science Publishers, BV., Amsterdam, NL, vol. 37, No. 1 / 05, Jan. 1, 1993, pp. 37-40, XP000329239, ISSN: 0165-6074.
Rohan Jude Fernandes, “Succint balanced binary tree and packed memory structure” Project Report for CS514, Design and Analysis of Data Structures and Algorithms II, XX, XX, Jan. 1, 2003, pp. 1-8, XP002466441.
European Search Report, Date mailed May 8, 2009 (7 pgs.).
U.S. Appl. No. 11/122,420, filed May 5, 2005, Richards.
U.S. Appl. No. 11/378,046, filed Mar. 17, 2006, Rizzolo et al.
U.S. Appl. No. 11/378,040, filed Mar. 17, 2006, German.
U.S. Appl. No. 10/924,458, filed Aug. 23, 2004, Lofthus et al.
U.S. Appl. No. 11/136,959, filed May 25, 2005, German et al.
U.S. Appl. No. 11/137,634, filed May 25, 2005, Lofthus et al.
U.S. Appl. No. 11/137,251, filed May 25, 2005, Lofthus et al.
U.S. Appl. No. 11/152,275, filed Jun. 14, 2005, Roof et al.
U.S. Appl. No. 11/156,778, filed Jun. 20, 2005, Swift.
U.S. Appl. No. 11/157,598, filed Jun. 21, 2005, Frankel.
U.S. Appl. No. 11/170,845, filed Jun. 30, 2005, Sampath et al.
U.S. Appl. No. 11/359,065, filed Feb. 22, 2005, Banton.
U.S. Appl. No. 11/364,685, filed Feb. 28, 2006, Hindi et al.

Affiliated with

Also associated with

Rating

Bounded sub-optimal problem solving does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Bounded sub-optimal problem solving, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounded sub-optimal problem solving will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2706211