- Hauptmenü-

Katalogdatenanzeige

Advances in Intelligent Systems and Applications - Volume 1: Proceedings of the International Computer Symposium ICS 2012 Held at Hualien, Taiwan, December 12–14, 2012

Kataloginformation Katalogdatensatz500177769 .

Kataloginformation
Feldname	Details
Vorliegende Sprache	eng
Hinweise auf parallele Ausgaben	38365954X Buchausg. u.d.T.: ‡Advances in intelligent systems and applications ; 1
ISBN	978-3-642-35451-9
Name	Chang, Ruay-Shiung
Name	Jain, L. C.
ANZEIGE DER KETTE	Jain, L. C.
Name	Peng, Sheng-Lung
T I T E L	Advances in Intelligent Systems and Applications - Volume 1
Zusatz zum Titel	Proceedings of the International Computer Symposium ICS 2012 Held at Hualien, Taiwan, December 12–14, 2012
Verlagsort	Berlin ; Heidelberg
Verlag	Springer
Erscheinungsjahr	2013
Erscheinungsjahr	2013
Umfang	Online-Ressource (XXIV, 725 p. 281 illus, digital)
Reihe	Smart Innovation, Systems and Technologies ; 20
Notiz / Fußnoten	Description based upon print version of record
Weiterer Inhalt	Title; Preface; Organization; Contents; Keynote Speeches; Track 1: Graph Theory and Algorithms; Track 2: Interconnection Networks and Combinatorial Algorithms; Track 3: Artificial Intelligence and FuzzySystems; Track 4: Database, Data Mining, and Information Retrieval; Track 5: Information Literacy, e-Learning, and Social Media; Track 6: Computer Networks andWeb Service/Technologies; Track 7:Wireless Sensor Networks; Track 8:Wireless Network Protocols; Track 9:Wireless Data Processing; Kernelization Algorithms; Introduction; Basic Definitions; References. Characterizing and Recognizing Probe Block GraphsIntroduction; Partitioned Probe Block Graphs; Unpartitioned Probe Block Graphs; References; An Upper Bound of the Rainbow Connection Number in RTCC Pyramids; Introduction; Preliminaries; A Rainbow Coloring on RTCC Networks; Concluding Remarks; References; On the Hamiltonian-Connectedness for Graphs Satisfying Ore's Theorem; Introduction; Proof of Theorem 3; Remarks; References; On Total Covers of Block-Cactus Graphs; Introduction; Preliminaries; Computing; for Block-Cactus Graphs; Computing (G) for Block-Cactus Graphs; Concluding Remarks. ReferencesRandomized Self-stabilization under Distributed Daemon for 6-Coloring Planar Graph; Introduction; The Algorithm; Correctness Proofs and Time Complexity Analysis; Concluding Remarks; References; An O(1.4786n)-Time Algorithm for the Maximum Induced Matching Problem; Introduction; Preliminaries; A Branch-and-Reduce Algorithm; A More Efficient Algorithm; References; 2-Rainbow Domination and Its Practical Variation on Weighted Graphs; Introduction; The WM2RD Problem on Unweighted Planar Graphs; The WM2RD Problem on Trees; A Practical Variation; Concluding Remarks; References. The Longest Path Problem on Distance-Hereditary GraphsIntroduction; Preliminaries; The Longest Path Problem; References; Balancing a Complete Signed Graph by Editing Edges and Deleting Nodes; Introduction; Preliminaries and Some Properties; Algorithms; Exact Algorithms; A Heuristic Algorithm; Experimental Results; Lower Bound for Algorithm Efficiencies; Node Selection Method for Branching; Performance of the Heuristic Algorithm; Discussion; Conclusion; References; Internally Disjoint Paths in a Variant of the Hypercube; Introduction; A Variant of the Hypercube: The Exchanged Hypercube. Internally Disjoint Paths and Wide DiameterReferences; Ranking and Unranking Algorithms for Loopless Generation of Non-regular Trees; Introduction; Non-regular Trees and Their Loopless Generation; Ranking Algorithm; Unranking Algorithm; References; Completely Independent Spanning Trees on Complete Graphs, Complete Bipartite Graphs and Complete Tripartite Graphs; Introduction; Completely Independent Spanning Trees in Complete Graphs; Completely Independent Spanning Trees in Complete Bipartite Graphs; Completely Independent Spanning Trees in Complete Tripartite Graphs; References. Diagnosable Evaluation of Enhanced Optical Transpose Interconnection System Networks
Titelhinweis	Buchausg. u.d.T.: ‡Advances in intelligent systems and applications ; 1
ISBN	ISBN 978-3-642-35452-6
Klassifikation	UYQ
	COM004000
	006.3
	Q342
Kurzbeschreibung	The field of Intelligent Systems and Applications has expanded enormously during the last two decades. Theoretical and practical results in this area are growing rapidly due to many successful applications and new theories derived from many diverse problems. This book is dedicated to the Intelligent Systems and Applications in many different aspects. In particular, this book is to provide highlights of the current research in Intelligent Systems and Applications. It consists of research papers in the following specific topics: l Graph Theory and Algorithmsl Interconnection Networks and Combinatorial Algorithmsl Artificial Intelligence and Fuzzy Systemsl Database, Data Mining, and Information Retrievall Information Literacy, e-Learning, and Social Medial Computer Networks and Web Service/Technologiesl Wireless Sensor Networks l Wireless Network Protocolsl Wireless Data Processing This book provides a reference to theoretical problems as well as practical solutions and applications for the state-of-the-art results in Intelligent Systems and Applications on the aforementioned topics. In particular, both the academic community (graduate students, post-doctors and faculties) in Electrical Engineering, Computer Science, and Applied Mathematics; and the industrial community (engineers, engineering managers, programmers, research lab staffs and managers, security managers) will find this book interesting.
SWB-Titel-Idn	377594415
Signatur	Springer E-Book
Bemerkungen	Elektronischer Volltext - Campuslizenz
Elektronische Adresse	$uhttp://dx.doi.org/10.1007/978-3-642-35452-6
Internetseite / Link	Volltext
Siehe auch	Inhaltsverzeichnis
Siehe auch	Inhaltstext
Siehe auch	Volltext
Siehe auch	Cover

ISBD-Anzeige Katalogdatensatz500177769

Kategorien-Anzeige Katalogdatensatz500177769

Titel zur Titelsammlung hinzufügen Katalogdatensatz500177769

Kataloginformation500177769 Datensatzanfang . Kataloginformation500177769 Seitenanfang .

Titel vormerken Katalogdatensatz500177769

Vollanzeige Katalogdaten

Auf diesem Bildschirm erhalten Sie Katalog- und Exemplarinformationen zum ausgewählten Titel.

Im Bereich Kataloginformation werden die bibliographischen Details angezeigt. Per Klick auf Hyperlink-Begriffe wie Schlagwörter, Autoren, Reihen, Körperschaften und Klassifikationen können Sie sich weitere Titel des gewählten Begriffes anzeigen lassen.

Der Bereich Exemplarinformationen enthält zum einen Angaben über den Standort und die Verfügbarkeit der Exemplare. Zum anderen haben Sie die Möglichkeit, ausgeliehene Exemplare vorzumerken oder Exemplare aus dem Magazin zu bestellen.