Appeal No. 1998-2263
Application No. 08/692,612
device coupled between said first object and said second object along said selected axis;
and
(2) determining, in the processor, said first value as a global minimum
solution for said function;
(f) determining a second value representing a combination of all of said first
values determined in step (e);
(g) repeating steps (b)-(f) for a plurality of axes; and
(h) determining a third value representing a combination of each of said second
values associated with each of said selected axes as determined in step (f), said third
value representing a distance between each of the plurality of objects;
(i) modifying the distance between said first object and said second object.
The prior art references of record relied upon by the examiner in rejecting the
appealed claims are:
Shikata et al. (Shikata) 5,309,371 May 3, 1994
(filed Jun. 26, 1990)
Tsay et al. (Tsay), PROUD: A SEA-OF-GATES PLACEMENT ALGORITHM, IEEE
DESIGN & TEST OF COMPUTERS, Vol. 5, No. 6, December 1988, pp. 44-56.
Jensen, Network flow programming, Chapter 1- NETWORK FLOW MODELS, pp. 1-
88, Chapter 11 -THE CONVEX MINIMUM COST FLOW PROBLEM, pp.339-366, Chapter
12 - CONCAVE COSTS, pp. 367-390 (John Wiley & Sons, Inc.), 1980.
Nahmias, Production and Operations Analysis, Section 7.6-Sequencing Algorithms for
Multiple Machines pp. 306-315, Section 8.1-Representing a Project as a Network
pp. 340-343 (Richard D. Irwin, Inc.), 1989.
Claim 35 stands rejected under 35 U.S.C. § 112, first paragraph as failing to
adequately teach how to make and/or use the invention. Claims 28, 30, 31, and 34-39
3
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 Next
Last modified: November 3, 2007