Abstract: Increased efficiency and lower cost job scheduling is provided by a system and method that optimizes for cost instead of makespan, and minimizes fluctuations in resource utilization. A schedule is constructed using a workflow scheduling system that includes a load leveler, a cost minimizer, and a manpower planner. The load leveler minimizes makespan, subject to resource limits, and then lowers the resource limits, repeating the process in order to create a flatter schedule. The cost minimizer generates an initial solution, and then incrementally improves it, using the manpower planner to evaluate the different possible solutions. The manpower planner calculates, for a given schedule, the optimal hire/fire decisions to minimize total cost.

Abstract: A traffic routing system reduces emissions from commuter and other traffic, eases congestion on roadways, and decreases transit time by use of communications among vehicles and traffic controls, such as traffic lights. In one aspect, a traffic light receives a signal that a vehicle is approaching and in response turns green to allow the vehicle to pass without impairment. In another aspect, a vehicle receives a signal to adjust a current rate of speed to arrive when a traffic signal allows vehicles to pass. In still another aspect, a combination of congestion, emergency traffic, roadwork and similar factors influence proposed routes sent to vehicles.

Abstract: A traffic routing display system provides a visual display of the expected state of an upcoming traffic light. In one aspect, the display is an icon colored to correspond to the expected state. In another aspect, the intensity of the color varies based on the certainty of the expectation. Another display shows the expected state of the traffic light at various speeds, allowing a driver to slow down for instance if the state of the light is not expected to be different at a slower speed. A speed limit icon is also displayed, and changes color when the speed limit is exceeded.

Abstract: A traffic routing display system provides a visual display of the expected state of an upcoming traffic light. In one aspect, the display is an icon colored to correspond to the expected state. In another aspect, the time remaining before the state of a traffic light changes is displayed. The effect that an indicator has on driver behavior is used to determine the type of indicator to provide to the driver. Certain indicators may not be displayed by the system depending on the effect they have on the driver.

Abstract: A system and method for flight planning determines an optimal route by considering a region of operation for an aircraft in a flight segment, dividing the region into subregions; estimating a minimum cost to traverse each subregion, determining the optimal route based on the sum of the estimates.

Abstract: Traffic information readings corresponding to a vehicle are received, the readings including at least a location. The traffic information readings are compared to information already within a map database, and are used to derive additional map information augmenting or correcting that already within the database, the additional map information subsequently being stored in the database. Additional information that is derived includes the presence of stop signs and traffic lights at intersections, the legality of turns at certain times of day, and the connectedness or non-connectedness of road segments.

Abstract: A system and method for distribution of campaign resources generates proposed allocations of resources, predicts electoral results based on such proposals, and selects strategies based on predetermined metrics. Both the activities of a protagonist (e.g., candidate) and of one or more opponents are considered. A campaign model considers polling impacts from the proposed allocations as well as electoral projections based on polling. Results are presented to a user via maps and timelines, as well as by alphanumeric data.

Abstract: N or more dimensions of information are presented on a conventional M-dimensional graph, where N>M, using a visual attribute type such as color to depict the additional dimensions of information. Each data input value comprised by the graph has additional values beyond those representing the M-dimensional aspects, and the visual attributes with which the data input value is presented on the graph is a function of these additional values. In one embodiment, a two-dimensional bar graph employs color to provide a visualization of the quality of a work schedule by depicting not only time and resource utilization, but also criticality of component work tasks.

Abstract: Data in a database describe an application domain such as a satisfiability problem. The data are represented in a manner that expresses the structure inherent in the data and one such representation uses group theory and represents the data as one or more “augmented clauses,” where each clause has a pair (c, G) including a database element c and a group G of group elements g acting on it. A query is encoded in a group theory representation and is executed on the group theory representation of the data to identify database elements and associated group elements satisfying the query. If desired, the satisfying database elements are converted from the group theory representation to the native representation of the data.

Abstract: Subsearch, where a satisfiability algorithm searches through the original theory for ground clauses that satisfy some numeric property, is represented in terms of S(C,P,u,s), the set of ground instances of C that have u literals unvalued by P and s literals satisfied by the assignments in P. This representation allows an intelligent search to be performed to answer subsearch problems posed in terms of S(C,P,u,s). Intelligent Subsearch uses truth value assignments to atoms to eliminate sets of bindings to universally quantified variables within a quantified clausal constraint; the bindings being eliminated because the bindings cannot satisfy a specific statement. Intelligent subsearch backtracks away from poor choices in the search for bindings to variables within the quantified clauses. In typical uses, intelligent subsearch can reduce the time of the checking problem from O(DU) to O(D&agr;U) for some &agr;<1.

Abstract: Assignment of attributes to elements subject to constraints is achieved using a system that has a systematic engine and a nonsystematic engine. The systematic engine includes a schedule developer for producing partial proposed assignments, a pruning processor for determining violations of discrepancy limits by a partial proposed assignment, and a bound selector for relaxing discrepancy limits as needed. The non-systematic engine includes a schedule packer for modifying assignments proposed by the systematic engine and an evaluator for comparing the modified assignments with the constraints.

Abstract: Assignment of attributes to elements subject to constraints is achieved using a system that has a systematic engine and a nonsystematic engine. The systematic engine includes a schedule developer for producing partial proposed assignments, a pruning processor for determining violations of discrepancy limits by a partial proposed assignment, and a bound selector for relaxing discrepancy limits as needed. The non-systematic engine includes a schedule packer for modifying assignments proposed by the systematic engine and an evaluator for comparing the modified assignments with the constraints.