2531 search results - page 98 / 507 » Group testing in graphs |
68
Voted
COMPSAC
2003
IEEE
15 years 6 months ago
2003
IEEE
Complete interaction testing of components is too costly in all but the smallest systems. Yet component interactions are likely to cause unexpected faults. Recently, design of exp...
87
Voted
CCS
2005
ACM
15 years 6 months ago
2005
ACM
We investigate whether it is possible to encrypt a database and then give it away in such a form that users can still access it, but only in a restricted way. In contrast to conve...
108
Voted
AIPS
2003
15 years 2 months ago
2003
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are rep...
120
click to vote
STACS
2009
Springer
15 years 7 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
86
Voted
ISSS
1997
IEEE
15 years 5 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...