I2 Technologies US, Inc.

I2 Technologies, Inc.

State of Oregon

University of Oregon

Jda Software Group, Inc.

James M Crawford, Jr

Brian M Kennedy

Matthew L Ginsberg

Mukesh Dalal

Joachim Paul Walser

William D Harvey

Ari K Jonsson

Joseph C Pemberton

Vibhu K Kalyan

LaMott G Oren

John C Hogge

Narayan Venkatasubramanyan

Michael G Pailas

Arun Kunchithapatham

Balakrishnan Vinod

Tiaohua Lin

Srinivas Palamarthy

Karel Zeithammer

A system for rendering content according to availability data for at least one item includes a server to receive a content request from a user and, in response, to retrieve requested content. A rendering engine coupled to the server identifies at least one rule associated with the content and concerning the item. A rules engine coupled to the rendering engine generates at least one availability request corresponding to the rule and concerning the item. The rules engine receives the availability data for the item, retrieves additional content according to the availability data for the item, and communicates the additional content to the rendering engine for incorporation into the requested content. The rendering engine renders the requested content, including the additional content concerning the item. The server communicates the rendered content to the user to satisfy the content request.

System and method for rendering content according to availability data for one or more items

Generating a price schedule involves generating a graph having paths that include states with values. The graph is generated by determining the values of a successor state from the values of a predecessor state. An optimal path is selected, and a price schedule is determined from the optimal path. Computing an elasticity curve involves having a demand model, values for demand model, and filter sets that restrict the values. Elasticity curves are determined by filtering the values using filter sets, and calculating the elasticity curve using the demand model. A best-fitting elasticity curve is selected. Adjusting a demand forecast value includes estimating an inventory and a demand at a number of locations. An expected number of unrealized sales at each location is calculated. An sales forecast value is determined according to the expected number.

Generating an optimized price schedule for a product

A method and system for solving constrained optimization problems. An initial abstract solution represents a prioritized set of decisions. The abstract solution is used as the basis for building a concrete solution. The concrete solution is analyzed to determine one or more local moves that represent a re-prioritization of the abstract solution. After a local moves is made, the process begins again with a new abstract solution, that is closer to an optimal solution. This process continues interactively until an optimal solution is reached or approached. The prioritized set of decisions can be implemented as a priority vector or a priority graph.

Computer implemented scheduling system and process using abstract local search technique

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.

System and process for job scheduling using limited discrepancy search

A system and method for searching a problem space. In an exemplary application, the search constructs a plan associated with a business enterprise and the problem space is a model of the enterprise. The search is divided into subsearches. Each subsearch is performed by a subsearch process having its own goal data, termination data, problem data, problem selection process, move process, and script. The script of a subsearch determines whether the current state of the search shall be advanced by a move of that subsearch or by another subsearch.

Computer implemented system and method for high level controlled searching through a problem space

A system is provided for optimizing a network plan. The system includes a memory which stores information specifying a network plan, a plurality of constraints, and a plurality of interaction coefficients. Each interaction coefficient corresponds to particular constraint. A processor is coupled to the memory. The processor is operable to determine whether the network plan violates any of the constraints, modify the network plan in order to resolve a violation of any constraint, and update a corresponding interaction coefficient in order to reflect an impact upon the network plan caused by the resolution of a violation.

System for optimizing a network plan and method of operation

Growing community of inventors

Flower Mound, TX, United States of America

James M Crawford, Jr