Policy driven print engine

Details Policy driven print engine Policy driven print engine

2005-02-15

2005-02-15

Lamb, Twyler (Department: 2622)

Facsimile and static presentation processing

Static presentation processing

Detail of medium positioning

C358S001150

Reexamination Certificate

active

06856411

ABSTRACT:
A scheduler for a machine includes a selector and a traverser. The selector selects the traverser and selects policies from a library based on a model of the machine. The traverser looks for a preferred itinerary. The scheduler includes a first module to choose an itinerary, a second module to calculate a combined weight, and logic to repeatedly operate the first and second modules to choose additional itineraries from the group of itineraries and calculate their combined weight until an end condition is reached. The end condition includes one or more of when a calculated combined weight for an itinerary exceeds a predetermined threshold, when a predetermined time has elapsed, when a combined weight for each of a predetermined number of itineraries has been calculated, and when a combined weight for each itinerary in the group of itineraries has been calculated. The first module chooses an itinerary from either a list of all of the itineraries or a sub-set of the itineraries. The second module includes an itinerary validator to compute an itinerary weight for the chosen itinerary for each of the policies and also includes a combiner to combine the computed itinerary weight for each of the policies into a combined weight for the chosen itinerary. The scheduler further includes a third module to choose an itinerary that has a combined weight calculated by the second module that is greater than a combined weight of any other itinerary calculated by the second module.

REFERENCES:
patent: 5129639 (1992-07-01), DeHority
patent: 5287194 (1994-02-01), Lobiondo
patent: 5604600 (1997-02-01), Webster
patent: 5696893 (1997-12-01), Fromherz et al.
patent: 5701557 (1997-12-01), Webster et al.
patent: 5710635 (1998-01-01), Webster et al.
patent: 6335795 (2002-01-01), Neuhard et al.
Steven Minton et al., “Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems”, Artificial Intelligence 58 (1992), pp. 161-205.
Rina Dechter, “Enhancement Schemes For Constraint Processing: Backjumping, Learning, and Cutset Decomposition”, Artificial Intelligence 41 (1989/90), pp. 273-312.
Alan K. Mackworth, “Consistency In Networks of Relations”, Artificial Intelligence 8 (1977), pp. 99-118.
Ian P. Gent et al., “An Empirical Study of Dynamic Variable Ordering Heuristics For the Constraint Satisfaction Problem”, Principals and Practice of Constraint Programming, LNAI Series #1118, (1996), pp. 179-193.
Gamma, B., et al.,Design Patterns: Elements of Reusable Object Oriented Code, Addison-Wesley Publishers, 1995, pp. 315-323.
Bjorn N. Freeman-Benson et al., “An Incremental Constraint Solver”, Communications of the ACM, Jan. 1990, vol. 33, No. 1, pp. 54-63.
Eugene C. Freuder et al., “Partial constraint satisfaction”, Artificial Intelligence 58 (1992), pp. 21-70.

Affiliated with

Also associated with

Rating

Policy driven print engine does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Policy driven print engine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Policy driven print engine will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3502584