Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
2005-08-16
2005-08-16
Smith, Matthew (Department: 2825)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000, C716S030000, C716S030000, C703S002000, C703S016000
Reexamination Certificate
active
06931608
ABSTRACT:
For a path search that identifies a path between source and target states in a space, some embodiments of the invention provide a method for determining viability of an expansion of a path from a first state to a second dimensional state. The method computes a first cost function that expresses the cost of the path to reach the second state. The first cost function is defined over the second state. The method then determines whether the first cost function expresses a better cost over any portion of the second state than a second cost function that expresses the best cost of paths that have reached the second state during the path search. The expansion is a viable one if the first cost function expresses a better cost over at least a portion of the second state than the second cost function.
REFERENCES:
patent: 4777606 (1988-10-01), Fournier
patent: 5224057 (1993-06-01), Igarashi et al.
patent: 5578840 (1996-11-01), Scepanovic et al.
patent: 5657242 (1997-08-01), Sekiyama et al.
patent: 5663891 (1997-09-01), Bamji et al.
patent: 5717600 (1998-02-01), Ishizuka
patent: 5729466 (1998-03-01), Bamji
patent: 5757089 (1998-05-01), Ishizuka
patent: 5757656 (1998-05-01), Hershberger et al.
patent: 5811863 (1998-09-01), Rostoker et al.
patent: 5822214 (1998-10-01), Rostoker et al.
patent: 5838583 (1998-11-01), Varadarajan et al.
patent: 5856927 (1999-01-01), Greidinger et al.
patent: 5877091 (1999-03-01), Kawakami
patent: 5880969 (1999-03-01), Hama et al.
patent: 5889329 (1999-03-01), Rostoker et al.
patent: 5889677 (1999-03-01), Yasuda et al.
patent: 5898597 (1999-04-01), Scepanovic et al.
patent: 5973376 (1999-10-01), Rostoker et al.
patent: 5980093 (1999-11-01), Jones et al.
patent: 5984510 (1999-11-01), Guruswamy et al.
patent: 5987086 (1999-11-01), Raman et al.
patent: 6006024 (1999-12-01), Guruswamy et al.
patent: 6016306 (2000-01-01), Le Boudec et al.
patent: 6067409 (2000-05-01), Scepanovic et al.
patent: 6086631 (2000-07-01), Chaudhary et al.
patent: 6110222 (2000-08-01), Minami et al.
patent: 6128767 (2000-10-01), Chapman
patent: 6154873 (2000-11-01), Takahashi
patent: 6154874 (2000-11-01), Scepanovic et al.
patent: 6175950 (2001-01-01), Scepanovic et al.
patent: 6209123 (2001-03-01), Maziasz et al.
patent: 6219823 (2001-04-01), Hama et al.
patent: 6226560 (2001-05-01), Hama et al.
patent: 6230306 (2001-05-01), Raspopovic et al.
patent: 6247167 (2001-06-01), Raspopovic et al.
patent: 6247853 (2001-06-01), Papadopoulou et al.
patent: 6253363 (2001-06-01), Gasanov et al.
patent: 6262487 (2001-07-01), Igarashi et al.
patent: 6286128 (2001-09-01), Pileggi et al.
patent: 6289495 (2001-09-01), Raspopovic et al.
patent: 6292929 (2001-09-01), Scepanovic et al.
patent: 6324674 (2001-11-01), Andreev et al.
patent: 6324675 (2001-11-01), Dutta et al.
patent: 6327693 (2001-12-01), Cheng et al.
patent: 6327694 (2001-12-01), Kanazawa
patent: 6330707 (2001-12-01), Shinomiya et al.
patent: 6349403 (2002-02-01), Dutta et al.
patent: 6407434 (2002-06-01), Rostoker et al.
patent: 6412102 (2002-06-01), Andreev et al.
patent: 6415427 (2002-07-01), Nitta et al.
patent: 6434730 (2002-08-01), Ito et al.
patent: 6436804 (2002-08-01), Igarashi et al.
patent: 6442745 (2002-08-01), Arunachalam et al.
patent: 6487709 (2002-11-01), Keller et al.
patent: 6490713 (2002-12-01), Matsumoto
patent: 6505331 (2003-01-01), Bracha et al.
patent: 6553514 (2003-04-01), Baumgartner et al.
patent: 6601227 (2003-07-01), Trimberger
patent: 6609237 (2003-08-01), Hamawaki et al.
patent: 6615401 (2003-09-01), Gasanov et al.
patent: 6618849 (2003-09-01), Teig et al.
patent: 6645842 (2003-11-01), Igarashi et al.
patent: 6656644 (2003-12-01), Hasegawa et al.
patent: 6665852 (2003-12-01), Xing et al.
patent: 6671859 (2003-12-01), Naylor et al.
patent: 6687893 (2004-02-01), Teig et al.
patent: 6732349 (2004-05-01), Sun et al.
patent: 6738960 (2004-05-01), Teig et al.
patent: 6745379 (2004-06-01), Teig et al.
patent: 6795958 (2004-09-01), Teig et al.
patent: 2001/0003843 (2001-06-01), Scepanovic et al.
patent: 2001/0038612 (2001-11-01), Vaughn et al.
patent: 2002/0043988 (2002-04-01), Or-Bach et al.
patent: 2002/0100009 (2002-07-01), Xing et al.
patent: 2002/0104061 (2002-08-01), Xing et al.
patent: 2002/0107711 (2002-08-01), Xing et al.
patent: 2002/0166105 (2002-11-01), Teig et al.
patent: 2002/0174412 (2002-11-01), Teig et al.
patent: 2002/0182844 (2002-12-01), Igarashi et al.
patent: 2002/0199165 (2002-12-01), Teig et al.
patent: 2003/0005398 (2003-01-01), Cho et al.
patent: 2003/0005399 (2003-01-01), Igarashi et al.
patent: 2003/0009737 (2003-01-01), Xing
patent: 2003/0014725 (2003-01-01), Sato et al.
patent: 2003/0018947 (2003-01-01), Teig et al.
patent: 2003/0023943 (2003-01-01), Teig et al.
patent: 2003/0025205 (2003-02-01), Shively
patent: 2003/0028359 (2003-02-01), Eggert et al.
patent: 2003/0056187 (2003-03-01), Teig et al.
patent: 2003/0066042 (2003-04-01), Teig et al.
patent: 2003/0066043 (2003-04-01), Teig et al.
patent: 2003/0066044 (2003-04-01), Teig et al.
patent: 2003/0066045 (2003-04-01), Teig et al.
patent: 2003/0079193 (2003-04-01), Teig et al.
patent: 2003/0088843 (2003-05-01), Mehrotra et al.
patent: 2003/0088844 (2003-05-01), Teig et al.
patent: 2003/0088845 (2003-05-01), Teig et al.
patent: 2003/0101029 (2003-05-01), Drumheller
patent: 2003/0101428 (2003-05-01), Teig et al.
patent: 2003/0106036 (2003-06-01), Aoki
patent: 2003/0115566 (2003-06-01), Teig
patent: 2003/0121017 (2003-06-01), Andreev et al.
patent: 2003/0188281 (2003-10-01), Xing
patent: 2004/0044979 (2004-03-01), Aji et al.
patent: 2004/0088670 (2004-05-01), Stevens et al.
patent: 02-262354 (1990-10-01), None
patent: 11-296560 (1999-10-01), None
Verwer et al., “An efficient uniform cost algorithm applied to distance transforms”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, No. 4, pp. 425-429, Apr. 1989.
Chen et al., “On finding multi-constrained paths”, IEEE International Conference on Communications, vol. 2, Jun. 7, 1998, pp. 874-879.
U.S. Appl. No. 10/335,062, filed Dec. 31, 2002, Steven Teig, CIP of U.S. Appl. Nos. 10/215,923, 10/215,563 and 10/215,896.
U.S. Appl. No. 10/066,060, filed Jan. 31, 2002, Steven Teig, parent application of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/066,160, filed Jan. 31, 2002, Steven Teig et al., parent application of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/066,095, filed Jan. 31, 2002, Steven Teig et al., parent application of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/066,047, filed Jan. 31, 2002, Steven Teig et al., parent application of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/061,641, filed Jan. 31, 2002, Steven Teig et al., parent application of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/066,094, filed Jan. 31, 2002, Steven Teig et al., parent application of U.S. Appl. Nos. 10/215,563 and 10/215,896.
U.S. Appl. No. 10/076,121, filed Feb. 12, 2002, Steven Teig, parent application of U.S. Appl. Nos. 10/215,563 and 10/215,896.
U.S. Appl. No. 10/062,995, filed Jan. 31, 2002, Steven Teig et al., parent application of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/066,102, filed Jan. 31, 2002, Steven Teig et al., parent application of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/066,187, filed Jan. 31, 2002, Steven Teig et al., parent application of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/228,679, filed Aug. 26, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/229,202, filed Aug. 26, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/229,170, filed Aug. 26, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/286,630, filed Oct. 31, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/230,504, filed Aug. 28, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563.
U.S. Appl. No. 10/215,923, filed Aug. 9, 2002, Steven Teig, The present application is a continuation of this application.
U.S. Appl. No. 10/226,483, filed Aug. 23, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923.
U.S. Appl. No. 10/226,774, filed Aug
Caldwell Andrew
Teig Steven
Cadence Design Systems Inc.
Kik Phallaka
Smith Matthew
Stattler Johansen & Adeli LLP
LandOfFree
Method and apparatus for determining viability of path... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for determining viability of path..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for determining viability of path... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3500417