Search Result Save to File Save as CSV
Your search for 36734 returns 1321 document(s)
The CISSP perp guide: mastering teh ten domains of computer security/ Ronald L. Krutz
Author: Krutz, Ronald L.; | Call Number: 005.8 Kru c | Type: Buku
Find Similar |  Add To Favorites |  Detail in New Window 
Intelligent Pedegogic Levelling untuk Klasifikasi Tingkat Kecerdasan Berdasarkan Learning Domains Menggunakan Self Organizing Maps (SOMs) (489-494)
Author: Setiawan Khoirul Muklis; | Call Number: SEM-315 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
A Less Costly Constraints Checking for Join Dependency (63-68)
Author: K.P. Tan; | Call Number: SEM-346 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Tajweed Checking System to Support Recitation (189-194)
Author: Ahsiah I. Noor N.M. Idris M.Y.I.; | Call Number: SEM-319 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Parellel object oriented implementation of a 2D bounded electrostactic plasma PIC simulation, Hal. 207-212
Author: Charles D. Norton; Boleslaw K. Szymanski; Viktor K. Decyk; | Call Number: SEM-229 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy(extended abstract),Hal 449-458
Author: Hans L.Bodlaender; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Threshold and bounded-delay voting in critical control systems, ((LNCS-Lecture Notes in Computer Science 1926) Hal 70-81
Author: Paul Caspi; Rym Salem; | Call Number: 004.33 Jos f | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Rounding theorem the possibility of applying cryptosystems on decimal numbers, page 15-20
Author: Rand Alfaris; Muhamad Rezal Kamel Arifin and Mohemed Rushdan Md said | Type: Indeks Artikel Jurnal
Find Similar |  Add To Favorites |  Detail in New Window 
A simple constructive computability theorem for wait-free compotation,Hal 243-252
Author: Maurice Herlihy; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Proses verifikasi prinati lunak basis data dengan lingu dan theorem prover hol
Call Number: 005 Pro | Type: Buku
Find Similar |  Add To Favorites |  Detail in New Window 
Prev   5 6 7 8 9 10 11 12 13 14  Next