455 search results - page 52 / 91 » Asynchronous and deterministic objects |
119
Voted
SACRYPT
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper formalizes the security adversarial games for online symmetric cryptosystems in a unified framework for deterministic and probabilistic encryption schemes. On...
APLAS
2008
ACM
15 years 4 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
116
click to vote
IPCO
1998
15 years 3 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
126
Voted
PAMI
2006
15 years 2 months ago
2006
A visual search is required when applying a recognition process on a scene containing multiple objects. In such cases, we would like to avoid an exhaustive sequential search. This...
118
Voted
ANOR
2005
15 years 2 months ago
2005
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...