Method and apparatus for optimally allocating resources

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 1520

Patent

active

053433882

ABSTRACT:
A method and apparatus for optimizing resource allocation is disclosed which uses a probabilistic relaxation network technique for obtaining an optimal or near optimal assignment solution. A network of nodes and arcs is created. Inputs to the arcs are calculated disregarding the old outputs from the arcs, the influences on the nodes are calculated based on the inputs to the arcs and the new values for the nodes are calculated based on the influences on the node.

REFERENCES:
patent: 4744026 (1988-05-01), Vanderbei
patent: 4744027 (1988-05-01), Bayer et al.
patent: 4744028 (1988-05-01), Karmarkar
patent: 4914563 (1990-04-01), Karmarkar et al.
patent: 5148365 (1992-09-01), Dembo
Garey, et al, "Computer and Intractability-A Guide to the Theory of NP-Completeness", 1979.
Rumelhart, et al, "Parallel Distributed Processing", vol. I & II, 1986.
Syslo, et al, "Discrete Optimization Algorithms" (1983).
Nemhauser, et al, "Integer and Combinatorial Optimization", (1988).
Probabilistic Networks and Optimization, Wedelin, RPT #49, May 1989, pp. 2-15.
Nyheter inom svensk programvaruut-veckling, "Framsteg Inom Vetenskap Och Teknik:," IVA, 1989, H.ang.kan Sodergren.
"Probabilistic Networks and Optimization", Dag Wedelin, Report 49, May 1989.
Nya algoritmer underlatter arbetsplanering, Dag Wedelin, CIC-News Mar. 4, 1988.
Aarts, E. H. L. and Korst, J. H. M. (1989), "Simulated Annealing and Boltzmann Machines", Wiley.
Balas, E. and Ho, A. (1979), "Set Covering Algorithms Using Cutting Planes, Heuristics and Subgradient Optimization: a Computational Study", Man. Sc. Res. Rep. 438, Carnegie-Melon Univ.
Chvatal, V (1979), "A Greedy-Heuristic for the Set-Covering Problem" Math. Oper. Res. 4,233-235.
Cooper, G. F. (1987) "Probabilistic Inference Using Belief Networks is NP-Hard", Memo KLS-87-27. Knowledge Systems Lab., Medical Comp. Sci. Group, Stanford Univ.
Geman, S. and Geman, D. (1984) "Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images", IEEE Trans. Pattern Anal. Machine Intell. 6, 721-741.
Hopfield, J. J. and Tank, D. W. (1985) "Neural Computation of Decisions in Optimization Problems. Biol. Cybern." 52, 141-152.
Hummel, R. A. and Zucker S. W. (1983) "On the Foundations of Relaxation Labeling Processes" IEEE Trans. Pattern Anal. Machine Intell. 3, 267-287.
Jensen, F. V., Olesen K. G. and Andersen, S. K. (1988) "An Algebra of Bayesian Belief Universes for Knowledge Based Systems" Research Report, Inst. of Electronic Systems, Aalborg Univ.
Lauritzen, S. L. and Spiegelhalter, D. S. (1988) "Local Computations with Probabilities on Graphical Structures and their Application to Expert Systems", J. R. Statist. Soc. B 50.
Pearl, J. (1986) "Fusion, Propagation and Structuring in Belief Networks" Artificial Intelligence 29, 241-288.
Peleg, S. (1980) "A New Probabilistic Relaxation Algorithm" IEEE Trans. Pattern Anal. and Machine Intell. 2, 362-369.
Rosenfeld, A., Hummel, R. A. and Zucker, S. W. (1976) "Scene Labeling by Relaxation Operations" IEEE Trans Syst., Man, Cybern. 6, 420-433.
Kanal, L. N. and Lemmer (eds) (1986) Uncertainty in Artificial Intelligence Amsterdam: North-Holland, "A Constraint-Propagation Approach to Probabilistic Reasoning", Pearl, pp. 357-369.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for optimally allocating resources does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for optimally allocating resources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for optimally allocating resources will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-34058

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.