Abstract: 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.

Abstract: 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.

Abstract: Calculating price elasticity includes accessing a number of demand models and demand data describing a number of items. The demand models are evaluated in accordance with the demand data. A demand model of the evaluated demand models is selected in response to the evaluation. A price elasticity is calculated according to the selected demand model.

Abstract: 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.

Abstract: A method of valuing products based on demand probabilities. Products are designed by identifying product components, and combining the components in various combinations to provide standard and non-standard products. Components are valued using an algorithm that considers demand probability as well as known prices of standard products. The component values are added to determine product values and may be used to make pricing and order fulfillment decisions.

Abstract: Calculating price elasticity includes accessing a number of demand models and demand data describing a number of items. The demand models are evaluated in accordance with the demand data. A demand model of the evaluated demand models is selected in response to the evaluation. A price elasticity is calculated according to the selected demand model.

Abstract: A method of valuing products based on demand probabilities. Products are designed by identifying product components, and combining the components in various combinations to provide standard and non-standard products. Components are valued using an algorithm that considers demand probability as well as known prices of standard products. The component values are added to determine product values and may be used to make pricing and order fulfillment decisions.

Abstract: Generating a price schedule involves generating a graph (50) having paths that include states (52) with values (54, 56, 58). The graph (50) is generated by determining the values (56, 58) of a successor state (52) from the values (56, 58) of a predecessor state (52). 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. An best-fitting elasticity curve is selected. Adjusting a demand forecast value (56) includes estimating an inventory and a demand at a number of locations (24). An expected number of unrealized sales at each location (24) is calculated. An sales forecast value (56) is determined according to the expected number.

Abstract: Calculating price elasticity includes accessing a number of demand models and demand data describing a number of items. The demand models are evaluated in accordance with the demand data. A demand model of the evaluated demand models is selected in response to the evaluation. A price elasticity is calculated according to the selected demand model.

Abstract: Random logic circuitry (210) is laid out in a logic array (212) that has a plurality of row and column locations. The logic circuitry (210) implements a plurality of dynamic logic circuits, each logic circuit having a plurality of logic gate field effect transistors (224) each formed at a selected intersection of one of the row locations and a predetermined plurality of the column locations. Elongate gate conductors (584-602) are formed at selected row locations in the logic array (212), each gate conductor provided as a gate for one or more of the logic gate transistors (224). Selected ones (e.g. 514, 544) of the transistors are merged in a row direction if the logic does not require them to be isolated from one another. A plurality of elongate second conductors (222) interconnect to selected ones of the sources or drains of the transistors (224). Non-Boolean portions of the logic circuitry are formed in an adjacent tile section (214) in the semiconductor layer separate from the logic array (212).

Abstract: Random logic circuitry (210) is laid out in a logic array (212) that has a plurality of row and column locations. The logic circuitry (210) implements a plurality of dynamic logic circuits, each logic circuit having a plurality of logic gate field effect transistors (224) each formed at a selected intersection of one of the row locations and one of the column locations. Elongate gate conductors (e.g., G, H, I) are formed at selected row locations in the logic array (212), each gate conductor provided as a gate for one or more of the logic gate transistors (224). A plurality of elongate second conductors (222) connect to selected ones of the sources or drains of the transistors (224) and to non-Boolean portions of the dynamic logic circuits. The non-Boolean portions are formed in an adjacent tile section (214) in the semi-conductor layer separate from the logic array (212).

Abstract: Random logic circuitry (210) is laid out in a logic array (212) that has a plurality of row and column locations. The logic circuitry (210) implements a plurality of dynamic logic circuits, each logic circuit having a plurality of logic gate field effect transistors (224) each formed at a selected intersection of one of the row locations and a predetermined plurality of the column locations. Elongate gate conductors (584-602) are formed at selected row locations in the logic array (212), each gate conductor provided as a gate for one or more of the logic gate transistors (224). Selected ones (e.g. 514, 544) of the transistors are merged in a row direction if the logic does not require them to be isolated from one another. A plurality of elongate second conductors (222) interconnect to selected ones of the sources or drains of the transistors (224). Non-Boolean portions of the logic circuitry are formed in an adjacent tile section (214) in the semiconductor layer separate from the logic array (212).

Abstract: Random logic circuitry (210) is laid out in a logic array (212) that has a plurality of row and column locations. The logic circuitry (210) implements a plurality of dynamic logic circuits, each logic circuit having a plurality of logic gate field effect transistors (224) each formed at a selected intersection of one of the row locations and one of the column locations. Elongate gate conductors (e.g., G, H, I) are formed at selected row locations in the logic array (212), each gate conductor provided as a gate for one or more of the logic gate transistors (224). A plurality of elongate second conductors (222) connect to selected ones of the sources or drains of the transistors (224) and to non-Boolean portions of the dynamic logic circuits. The non-Boolean portions are formed in an adjacent tile section (214) in the semi-conductor layer separate from the logic array (212).