Search Result Save to File Save as CSV
Your search for 36734 returns 1321 document(s)
Positive solutions for p-laplacian discrete boundary value problems via three critical points theorem, 562-
Author: Benshi Zhu; | Call Number: SEM-347 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Proses verifikasi piranti lunak menggunakan lingu dan theorem prover hol pada studi kasus student entrance test/ Carroline D. Puspa
Author: Carroline D. Puspa; | Call Number: SK-0621(Softcopy SK-102) Source Code SK-89 | Edition: Heru Suhartanto | Type: Skripsi
Find Similar |  Add To Favorites |  Detail in New Window 
A format-independent architecture for run-time integrity checking of executable code, (LNCS-Lecture Notes in Computer Science 2576) Hal 219-233
Author: Luigi Catuogno; Ivan Visconti; | Call Number: 005.8 Sec | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Deadlock checking using net unfoldings, (LNCS-Lecture Notes in Computer Science 1254) Hal 352-363
Author: Stephan Melzer; Stefan Romer; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Termilog: a system for checking termination of queries to logic programs, (LNCS-Lecture Notes in Computer Science 1254) Hal 444-447
Author: N. Lindenstrauss; Y. Sagiv; A. Serebrenik; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
TermiLong: a system for checking termination of queries to logic programs, (LNCS-Lecture Notes in Computer Science 1254)Hal. 444-447
Author: N. Lindenstrauss, Y. Sagiv; A. Serebernik; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Deadlock checking using net unforldings, (LNCS-Lecture Notes in Computer Science 1254) Hal. 352-363
Author: Stephan Melzer and Stefan Romer; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Towards implementations for advanced equivalence checking in answer-set programming, (LNCS-Lecture Notes in Computer Science 3668) Hal 189-203
Author: Hans Tompits; Stefan Woltran; | Call Number: 005.133 Gab l | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Database Theory and Database Systems: Definable Relations and First-Order Query Languages Over Strings
Author: M. Benedikt, [et all] | Type: Indeks Artikel Jurnal
Find Similar |  Add To Favorites |  Detail in New Window 
Exploiting k-Constraints to Reduce Memory Overhead in Continuous Queries Over Data Streams, page 545-579
Author: S. Babu, [et all] | Type: Indeks Artikel Jurnal
Find Similar |  Add To Favorites |  Detail in New Window 
Prev   12 13 14 15 16 17 18 19 20 21  Next