✦ LIBER ✦

Networking 101: A brief course on the basics

✍ Scribed by Garofolo, Greg

Book ID: 122351554
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 180 KB
Volume: 6
Category: Article
ISSN: 1076-6332
DOI: 10.1016/S1076-6332(99)80124-X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Java Tutorial: A Short Course on the

The Java Tutorial: A Short Course on the Basics

✍ Mary Campione, Kathy Walrath, Alison Huml 📂 Library 📅 2001 🏛 Prentice Hall 🌐 English ⚖ 2 MB

Whether you're taking a class or learning on the job, The JavaT Tutorial, Third Edition, is a hands-on guide that lets you quickly become proficient with the Java programming language. Written by members of the Java Software team at Sun Microsystems, the book uses an interactive approach to help you

The Java Tutorial: A Short Course on the

The Java Tutorial: A Short Course on the Basics

✍ Sharon Zakhour, Scott Hommel, Jacob Royal, Isaac Rabinovitch, Tom Risser, Mark H 📂 Library 📅 2006 🏛 Prentice Hall 🌐 English ⚖ 3 MB

A hands-on guide to the Java programming language, The JavaT Tutorial, Fourth Edition is perfect for any developer looking for a proven path to proficiency with Java SE. This popular tutorial "from the Source" has been completely revised and updated to cover Version 6 of the Java Platform, Standard

A basic course in network analysis. I. C

A basic course in network analysis. I. Content, results, instruction

✍ de Brain, F.F.G.; Vos, H. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 523 KB

A Brief Course in the Calculus

✍ P., P. 📂 Article 📅 1909 🏛 Nature Publishing Group 🌐 English ⚖ 121 KB

A Brief History of Networking in the U.S

A Brief History of Networking in the U.S.

✍ Meyer, E.; Funkhouser, N.F. 📂 Article 📅 1998 🏛 American Chemical Society 🌐 English ⚖ 100 KB

Introductory Lectures on Convex Optimiza

Introductory Lectures on Convex Optimization: A Basic Course

✍ Y. Nesterov 📂 Library 📅 2003 🏛 Springer 🌐 English ⚖ 2 MB

This is the first elementary exposition of the main ideas of complexity theory for convex optimization. Up to now, most of the material can be found only in special journals and research monographs. The book covers optimal methods and lower complexity bounds for smooth and non-smooth convex opti