| Your search for 37530 returns 2330 document(s) |
| Effecient zero-knowledge proofs for some practical graph problems, (LNCS-Lecture Notes in Computer Science 2576) Hal 290-302 |
|
Author: Yvo Desmedt; Yongge Wang; | Call Number: 005.8 Sec | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Symmetry definitions for constraint satisfaction problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 17-31 |
|
Author: David Cohen; Peter Jeavons; Christopher Jefferson; Karen E. Petrie; Barbara M. Smith; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Distributed stable matching problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 152-166 |
|
Author: Ismel Brito; Pedro Meseguer; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Solving the MOLR and social golfers problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 286-300 |
|
Author: Warwick Harvey; Thorsten Winterer; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Breaking all value symmetries in surjection problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 490-504 |
|
Author: Jean-Francois Puget; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Caching search states in permutation problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 637-651 |
|
Author: Barbara M. Smith; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Solving simple planning problems with more inference and no search, (LNCS-Lecture Notes in Computer Science 3709) Hal 682-696 |
|
Author: Vincent Vidal; Hector Geffner; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Solving large-scale nonlinear programming problems by constraint partitioning, (LNCS-Lecture Notes in Computer Science 3709) Hal 697-711 |
|
Author: Benjamin W. Wah; Yixin Chen; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Extending systematic local search for job shop scheduling problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 762-766 |
|
Author: Bistra Dilkina; Lei Duan; William S. Havens; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Consistency for quantified constraint satisfaction problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 792-796 |
|
Author: Peter Nightingale; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Search Result