"Shortest Common Superstring Problem with Discrete Neural Networks"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Neural Networks with R.	Ciaburro, Giuseppe.	2017.	Packt Publishing,
Learning with Recurrent Neural Networks	Barbara Hammer	2000	Springer London
Computational Mechanics with Neural Networks	Genki Yagawa; Atsuya Oishi	1st ed. 2021	Springer International Publishing
Exploring Neural Networks with C#	Ryszard Tadeusiewicz; Rituparna Chaki; Nabendu Chaki	2015	Routledge
Simulating neural networks with Mathematica	Freeman, James A.	1994	Addison-Wesley
Neural Networks	Herve Abdi; Dominique Valentin; Betty Edelman	December 1998	SAGE Publications, Inc
Neural Networks	E. Gelenbe	1992	North-Holland
Neural Networks	Eric Davalo, Patrick Naïm (auth.)	1991	Macmillan Education UK
Neural networks /	Abdi, Hervé.; Valentin, Dominique.; Edelman, Betty.	[1999], ©1999.	Sage Publications,
Neural networks	Philip Picton	2000	Palgrave
Discrete-Time Neural Observers	Alma Y. Alanis and Edgar N. Sanchez	2017	Academic Press
Neural Networks with Discontinuous/Impact Activations	Marat Akhmet; Enes Yılmaz	2014	Springer New York
Modelling Perception with Artificial Neural Networks	Colin R. Tosh; Graeme D. Ruxton	2010-06	Cambridge University Press
Introduction to Neural Networks with Java	Jeff, T Heaton	November 25, 2005	Heaton Research, Inc.
Neural Modeling and Neural Networks	F. Ventriglia	1994	Pergamon
Constructive Neural Networks	Leonardo Franco; José M. Jerez	2010	Springer Berlin Heidelberg
Neural Networks Theory	Alexander I. Galushkin	2007	Springer Berlin Heidelberg
Optical Neural Networks	Cornelia Denz	1998	Vieweg+Teubner Verlag
Artificial Neural Networks	Hugh Cartwright	2nd ed. 2015	Springer New York
Artificial Neural Networks	Hugh Cartwright	3rd ed. 2021	Springer US
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
Shortest Common Superstring Problem with Discrete Neural Networks	D. López-Rodríguez; E. Mérida-Casermeiro	Adaptive and Natural Computing Algorithms: 9th International Conference, ICANNGA 2009, Kuopio, Finland, April 23-25, 2009, Revised Selected Papers	Ville Kolehmainen; Pekka Toivanen; Bartlomiej Beliczynski	2009	Springer Berlin Heidelberg
Shortest Common Superstring		The Algorithm Design Manual	Steve S. Skiena	1998	TELOS--the Electronic Library of Science
179 Shortest Common Superstring		The Algorithm Design Manual	Steve S. Skiena	1998	TELOS--the Electronic Library of Science
The Shortest Superstring Problem	Theodoros P. Gevezes; Leonidas S. Pitsoulis	Optimization in Science and Engineering: In Honor of the 60th Birthday of Panos M. Pardalos	Themistocles M. Rassias; Christodoulos A. Floudas; Sergiy Butenko	2014	Springer New York
Reoptimization of the Shortest Common Superstring Problem	Davide Bilò; Hans-Joachim Böckenhauer; Dennis Komm; Richard Královič; Tobias Mömke; Sebastian Seibert et al.	Combinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings	Gregory Kucherov; Esko Ukkonen	2009	Springer Berlin Heidelberg
Shortest Superstring	Vijay V. Vazirani	Approximation Algorithms	Vijay V. Vazirani	2003	Springer Berlin Heidelberg
Why Greed Works for Shortest Common Superstring Problem	Bin Ma	Combinatorial Pattern Matching: 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings	Paolo Ferragina; Gad M. Landau	2008	Springer Berlin Heidelberg
A Genetic Algorithm for the Shortest Common Superstring Problem	Luis C. González; Heidi J. Romero; Carlos A. Brizuela	Genetic and Evolutionary Computation — GECCO 2004: Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26–30, 2004 Proceedings, Part II	Kalyanmoy Deb; Riccardo Poli; Wolfgang Banzhaf; Hans-Georg Beyer; Edmund Burke; Paul Darwen; Dipankar Dasgupta; Dario Floreano; James A. Foster; Mark Harman; Owen Holland; Pier Luca Lanzi; Lee Spector; Andrea Tettamanzi; Dirk Thierens; Andy Tyrrell	2004	Springer Berlin Heidelberg
Algorithms for Three Versions of the Shortest Common Superstring Problem	Maxime Crochemore; Marek Cygan; Costas Iliopoulos; Marcin Kubica; Jakub Radoszewski; Wojciech Rytter et al.	Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings,	Amihood Amir; Laxmi Parida	2010	Springer Berlin Heidelberg
A Probabilistic PTAS for Shortest Common Superstring	Kai Plociennik	Mathematical Foundations of Computer Science 2009: 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009, Proceedings	Rastislav Královic; Damian Niwinski	2009	Springer Berlin Heidelberg
On Shortest Common Superstring and Swap Permutations	Zvi Gotthilf; Moshe Lewenstein; Alexandru Popa	String Processing and Information Retrieval: 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010, Proceedings	Edgar Chavez; Stefano Lonardi	2010	Springer Berlin Heidelberg
On the Shortest Common Superstring of NGS Reads	Tristan Braquelaire; Marie Gasparoux; Mathieu Raffinot; Raluca Uricaru	Theory and Applications of Models of Computation: 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings	T.V. Gopal; Gerhard Jäger; Silvia Steila	1st ed. 2017	Springer International Publishing
Greedy Shortest Common Superstring Approximation in Compact Space	Jarno Alanko; Tuukka Norri	String Processing and Information Retrieval: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017, Proceedings	Gabriele Fici; Marinella Sciortino; Rossano Venturini	1st ed. 2017	Springer International Publishing
Problem Solving with Neural Networks	Wolfram Menzel	Intelligence and Artificial Intelligence: An Interdisciplinary Debate	Ulrich Ratsch; Michael M. Richter; Ion-Olimpiu Stamatescu	1998	Springer Berlin Heidelberg
Discrete Recurrent Neural Networks	Zhang Yi; K. K. Tan	Convergence Analysis of Recurrent Neural Networks	Zhang Yi	2004	Springer US
Improved length bounds for the shortest superstring problem	Chris Armen; Clifford Stein	Algorithms and Data Structures: 4th International Workshop, WADS ' 95, Kingston, Canada, August 16 - 18, 1995. Proceedings	Selim G. Akl; Frank Dehne; Jörg-Rüdiger Sack; Nicola Santoro	1995	Springer Berlin Heidelberg
Approximating Shortest Superstring Problem Using de Bruijn Graphs	Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin	Combinatorial Pattern Matching: 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013, Proceedings	Johannes Fischer; Peter Sanders	2013	Springer Berlin Heidelberg
Explicit Inapproximability Bounds for the Shortest Superstring Problem	Virginia Vassilevska	Mathematical Foundations of Computer Science 2005: 30th International Symposium, MFCS 2005, Gdansk, Poland, August29-September 2. 2005, Proceedings	Joanna Jedrzejowicz; Andrzej Szepietowski	2005	Springer Berlin Heidelberg
Analog versus Discrete Neural Networks			MIT Press	1996	MIT Press
Solving the Shortest Common Supersequence Problem	G. Nicosia; G. Oriolo	Operations Research Proceedings: Selected Papers of the Symposium on Operations Research (OR 2000) Dresden, September 9–12, 2000	B. Fleischmann; R. Lasch; U. Derigs; W. Domschke; U. Rieder	2001	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Shortest Common Superstring Problem with Discrete Neural Networks" - similar Books and Chapters