{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:47:13Z","timestamp":1725540433554},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642104411"},{"type":"electronic","value":"9783642104428"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10442-8_8","type":"book-chapter","created":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T12:34:20Z","timestamp":1257165260000},"page":"56-69","source":"Crossref","is-referenced-by-count":0,"title":["Evolutionary Design of Graph-Based Structures for Optical Computing"],"prefix":"10.1007","author":[{"given":"Mihai","family":"Oltean","sequence":"first","affiliation":[]},{"given":"Oana","family":"Muntean","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: NP-complete problems and physical reality. ACM SIGACT News Complexity Theory Column, March. ECCC TR05-026, quant-ph\/0502072 (2005)","DOI":"10.1145\/1052796.1052804"},{"key":"8_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0055923","volume-title":"Genetic Programming - An Introduction","author":"W. Banzhaf","year":"1998","unstructured":"Banzhaf, W., Nordin, P., Keller, E.R., Francone, F.D.: Genetic Programming - An Introduction. Morgan Kaufmann, San Francisco (1998)"},{"key":"8_CR3","volume-title":"Dynamic Programming","author":"R. Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/4235.910462","volume":"5","author":"M. Brameier","year":"2001","unstructured":"Brameier, M., Banzhaf, W.: A Comparison of Linear Genetic Programming and Neural Networks in Medical Data Mining. IEEE Transactions on Evolutionary Computation\u00a05, 17\u201326 (2001)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"8_CR5","unstructured":"Dolev, S., Nir, Y.: Optical Implementation of Bounded non Deterministic Turing Machine, Patent Filed May 2003 in Israel, May 2004 USA (2004)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-72914-3_12","volume-title":"Fun with Algorithms","author":"S. Dolev","year":"2007","unstructured":"Dolev, S., Fitoussi, H.: The Traveling Beams, Optical Solutions for Bounded NP-Complete Problems. In: Crescenzi, P., Prencipe, G., Pucci, G. (eds.) FUN 2007. LNCS, vol.\u00a04475, pp. 120\u2013134. Springer, Heidelberg (2007)"},{"key":"8_CR7","volume-title":"Computers and intractability: A guide to NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to NP-Completeness. Freeman & Co., San Francisco (1979)"},{"key":"8_CR8","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"10473","DOI":"10.1364\/OE.15.010473","volume":"15","author":"T. Haist","year":"2007","unstructured":"Haist, T., Osten, W.: An Optical Solution For The Traveling Salesman Problem. Opt. Express\u00a015, 10473\u201310482 (2007)","journal-title":"Opt. Express"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"12627","DOI":"10.1364\/OE.15.012627","volume":"15","author":"T. Haist","year":"2007","unstructured":"Haist, T., Osten, W.: An Optical Solution For The Traveling Salesman Problem:erratum. Opt. Express\u00a015, 12627\u201312627 (2007)","journal-title":"Opt. Express"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-85673-3_3","volume-title":"Optical SuperComputing","author":"T. Haist","year":"2008","unstructured":"Haist, T., Osten, W.: Ultra-fast digital optical arithmetic using waveoptical computing. In: Dolev, S., Haist, T., Oltean, M. (eds.) OSC 2008. LNCS, vol.\u00a05172, pp. 33\u201345. Springer, Heidelberg (2008)"},{"key":"8_CR12","volume-title":"Genetic Programming: on the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: on the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"key":"8_CR13","volume-title":"Genetic Programming II: Automatic Discovery of Reusable Subprograms","author":"J.R. Koza","year":"1994","unstructured":"Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Subprograms. MIT Press, Cambridge (1994)"},{"key":"8_CR14","volume-title":"Genetic Programming III: Darwinian Invention and Problem Solving","author":"J.R. Koza","year":"1999","unstructured":"Koza, J.R., et al.: Genetic Programming III: Darwinian Invention and Problem Solving. Morgan Kaufmann, San Francisco (1999)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-540-46239-2_9","volume-title":"Genetic Programming","author":"J.F. Miller","year":"2000","unstructured":"Miller, J.F., Thomson, P.: Cartesian Genetic Programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol.\u00a01802, pp. 121\u2013132. Springer, Heidelberg (2000)"},{"key":"8_CR16","unstructured":"Muntean, O.: Optical Solutions for NP-complete problems, graduation thesis, Faculty of Mathematics and Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania, defended July 3 (2007)"},{"issue":"8","key":"8_CR17","first-page":"2159","volume":"5","author":"O. Muntean","year":"2009","unstructured":"Muntean, O., Oltean, M.: Using light for solving the unbounded subset-sum problem. International Journal of Innovative Computing, Information and Control\u00a05(8), 2159\u20132167 (2009)","journal-title":"International Journal of Innovative Computing, Information and Control"},{"key":"8_CR18","unstructured":"Muntean, O., Oltean, M.: Deciding whether a linear Diophantine equation has solutions by using a light-based device (submitted) (2008)"},{"key":"8_CR19","first-page":"311","volume-title":"Advances in Genetic Programming","author":"P. Nordin","year":"1994","unstructured":"Nordin, P.: A Compiling Genetic Programming System that Directly Manipulates the Machine Code. In: Kinnear Jr., K.E. (ed.) Advances in Genetic Programming, pp. 311\u2013331. MIT Press, Cambridge (1994)"},{"key":"8_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1007\/978-3-540-39432-7_70","volume-title":"Advances in Artificial Life","author":"M. Oltean","year":"2003","unstructured":"Oltean, M., Gro\u015fan, C.: Evolving evolutionary algorithms using multi expression programming. In: Banzhaf, W., Ziegler, J., Christaller, T., Dittrich, P., Kim, J.T. (eds.) ECAL 2003. LNCS (LNAI), vol.\u00a02801, pp. 651\u2013658. Springer, Heidelberg (2003)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11839132_18","volume-title":"Unconventional Computation","author":"M. Oltean","year":"2006","unstructured":"Oltean, M.: A light-based device for solving the Hamiltonian path problem. In: Calude, C.S., Dinneen, M.J., P\u0103un, G., Rozenberg, G., Stepney, S. (eds.) UC 2006. LNCS, vol.\u00a04135, pp. 217\u2013227. Springer, Heidelberg (2006)"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s11047-007-9042-z","volume":"7","author":"M. Oltean","year":"2008","unstructured":"Oltean, M.: Solving the Hamiltonian path problem with a light-based computer. Natural Computing\u00a07(1), 57\u201370 (2008)","journal-title":"Natural Computing"},{"issue":"2","key":"8_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s11047-007-9059-3","volume":"8","author":"M. Oltean","year":"2009","unstructured":"Oltean, M., Muntean, O.: Solving the subset-sum problem with a light-based device. Natural Computing\u00a08(2), 321\u2013331 (2009)","journal-title":"Natural Computing"},{"issue":"4","key":"8_CR24","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s00354-008-0049-5","volume":"26","author":"M. Oltean","year":"2008","unstructured":"Oltean, M., Muntean, O.: Exact Cover with light. New Generation Computing\u00a026(4), 329\u2013346 (2008)","journal-title":"New Generation Computing"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-85673-3_10","volume-title":"Optical SuperComputing","author":"M. Oltean","year":"2008","unstructured":"Oltean, M., Muntean, O.: Solving NP-Complete Problems with Delayed Signals: An Overview of Current Research Directions. In: Dolev, S., Haist, T., Oltean, M. (eds.) OSC 2008. LNCS, vol.\u00a05172, pp. 115\u2013127. Springer, Heidelberg (2008)"},{"issue":"2","key":"8_CR26","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1142\/S0218213009000111","volume":"19","author":"M. Oltean","year":"2009","unstructured":"Oltean, M., Grosan, C., Diosan, L., Mihaila, C.: Genetic Programming with linear representation: a survey. International Journal on Artificial Intelligence Tools\u00a019(2), 197\u2013238 (2009)","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"8_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-48885-5","volume-title":"Advances in Genetic Programming 3, ch. 13","author":"R. Poli","year":"1999","unstructured":"Poli, R., Langdon, W.B.: Sub-machine Code Genetic Programming. In: Spector, L., Langdon, W.B., O\u2019Reilly, U.-M., Angeline, P.J. (eds.) Advances in Genetic Programming 3, ch. 13. MIT Press, Cambridge (1999)"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Poli, R., Page, J.: Solving High-Order Boolean Parity Problems with Smooth Uniform Crossover, Sub-Machine Code GP and Demes. Journal of Genetic Programming and Evolvable Machines, 1\u201321 (2000)","DOI":"10.1023\/A:1010068314282"},{"key":"8_CR29","unstructured":"Syswerda, G.: Uniform Crossover in Genetic Algorithms. In: Schaffer, J.D. (ed.) Proceedings of the 3rd International Conference on Genetic Algorithms, MKP, CA, pp. 2\u20139 (1989)"},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H., McReady, W.G.: No Free Lunch Theorems for Optimisation. IEEE Transaction on Evolutionary Computation\u00a01, 67\u201382 (1997)","journal-title":"IEEE Transaction on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Optical SuperComputing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10442-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:56:04Z","timestamp":1606186564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10442-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642104411","9783642104428"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10442-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}