Patent EP0453193A2 successfully refreshed from Google Patents.
US5289370A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Automated resource allocation method employing a learning arrangement
Assignee: Nokia Bell Labs
•
Filing: 1991-05-31
•
Granted: 1994-02-22
•
Expires: 2011-05-31
Abstract
Abstract A facility is provided for allocating a constrained common resource among a plurality of demands, in which a recommended solution to such an allocation is achieved by employing partial solutions priorly generated and stored in a database as a result of allocating the common resource among a plurality of prior, and possibly different, demands for the common resource.
Inventors
- 👤 Yuval V. Lirov
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 23:57
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/04; G06Q10/043; G06Q10/06; G06Q10/063; G06Q10/0631; G06Q10/06315; G06Q10/06316
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
177 words
A method for allocating a constrained common resource among a current plurality of demands for the resource comprising the steps of (a) searching a database having stored therein a plurality of prior partial solutions generated as a result of allocating said common resource among respective ones of a plurality of prior demands and selecting from said database those of said prior partial solutions that may be used to form a recommended solution of allocating said resource among said current plurality of demands, (b) generating a multiplicity ratio for each of said selected partial solutions, (c) responsive to each said multiplicity ratio and its corresponding one of said selected partial solutions, reducing said selected partial solutions to a single partial solution, which can be included in said recommended solution, (d) repeating steps (a), (b), and (c) until a predetermined level of tolerance is met, (e) providing each said single partial solution and its corresponding multiplicity ratio as the recommended solution, and (e) allocating the common resource among the current plurality of demands in accordance with the recommended solution.
Claim 2
Independent Claim
177 words
A method for allocating a constrained common resource among a current plurality of demands for the resource comprising the steps of (a) searching a database having stored therein a plurality of prior partial solutions generated as a result of allocating said common resource among respective ones of a plurality of prior demands and selecting from said database those of said prior partial solutions that may be used to form a recommended solution of allocating said resource among said current plurality of demands, (b) generating a multiplicity ratio for each of said selected partial solutions, (c) responsive to each said multiplicity ratio and its corresponding one of said selected partial solutions, reducing said selected partial solutions to a single partial solution, which can be included in said recommended solution, (d) repeating steps (a), (b), and (c) until a predetermined level of tolerance is met, (e) providing each said single partial solution and its corresponding multiplicity ratio as the recommended solution, and (e) allocating the common resource among the current plurality of demands in accordance with the recommended solution.
Claim 3
Dependent Claim
62 words
The method set forth in claim 1 wherein said step of searching and selecting includes the steps of (h) determining the distance between each of said partial solutions stored in said database and an ideal solution serving as a goal in determining said recommended solution, and (i) selecting as candidates those of said partial solutions whose associated distance is a minimum value.
Claim 4
Dependent Claim
77 words
The method set forth in claim 1 wherein said step of generating said multiplicity ratio includes the steps of (h) responsive to a first one of said selected partial solutions, generating a plurality of multiplicity ratios, (i) selecting as the multiplicity ratio for said first partial solution the integer portion of that one of said multiplicity ratios having the smallest value, and (j) repeating steps (h) and (i) for the remaining ones of said selected partial solutions.
Claim 5
Dependent Claim
84 words
The method set forth in claim 1 wherein said step of reducing said selected partial solutions to a single partial solution includes the steps of (h) generating a residual demand for each of said selected partial solutions, (i) generating an evaluation ratio for each said demand, (j) comparing the evaluation ratio for each of said selected partial solutions, and (k) responsive to the evaluation ratio having the smallest value, appending to the recommended solution the corresponding selected partial solution, residual demand and multiplicity value.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-02-21 | 1997-08-23 | 1998-02-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-02-21 | 2001-08-23 | 2002-02-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-02-21 | 2005-08-23 | 2006-02-22 | $7700.00 | Window Closed / Lapsed |