Search Result Save to File Save as CSV
Your search for 37649 returns 3062 document(s)
A new algorithm for discrete timed symbolic model checking, (LNCS-Lecture Notes in Computer Science 1201) Hal 18-32
Author: Jurgen Ruf; Thomas Kropf; | Call Number: 004.33 Mal h | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
An n log n algorithm for online BDD refinement, (LNCS-Lecture Notes in Computer Science 1254) Hal 107-118
Author: Nils Klarlund; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Algorithm refinement with read and write frames, (LNCS-Lecture Notes in Computer Science 670) Hal 148-161
Author: Juan Bicarregui; | Call Number: 004 Woo f | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Compilation increasing the scheduling scope for multi-memory-FPGA-based custom computing machines, (LNCS-Lecture Notes in Computer Science 2147) Hal 523-533
Author: Joao M P Cardoso; Horacio C Neto; | Call Number: 005.115 Fie | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Inter-distance constraint: an extension of the all-different constraint for scheduling equal length jobs, (LNCS-Lecture Notes in Computer Science 3709) Hal 62-76
Author: Konstantin Artiouchine; Philippe Baptiste; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
PLI: a new framework to protect digital content for P2P networks, (LNCS-Lecture Notes in Computer Science 2576) Hal 206-216
Author: Guofei Gu; Bin B. Zhu; Shipeng Li; Shiyong Zhang; | Call Number: 005.8 Zho a | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Computing and exploiting tree-decompositions for solving constraint networks, (LNCS-Lecture Notes in Computer Science 3709) Hal 777-781
Author: Philippe Jegou; Samba Ndojh Ndiaye; Cyril Terrioux; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
And/or search spaces and the semantic width of constraint networks, (LNCS-Lecture Notes in Computer Science 3709) Hal 860
Author: Robert Mateescu; Rina Dechter; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Compositional verification of synchronous networks, (LNCS-Lecture Notes in Computer Science 1926) Hal 214-227
Author: Leszek Holenderski; | Call Number: 004.33 Jos f | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Verifying universal properties of parameterized networks, (LNCS-Lecture Notes in Computer Science 1926) Hal 291-303
Author: Kai Baukus; Yassine Lakhnech; Karsten Stahl; | Call Number: 004.33 Jos f | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Prev   1 2 3 4 5 6 7 8 9 10  Next