Sciweavers

455 search results - page 52 / 91
» Asynchronous and deterministic objects
Sort
View
SACRYPT
2004
Springer
143views Cryptology» more  SACRYPT 2004»
14 years 1 months ago
Blockwise Adversarial Model for On-line Ciphers and Symmetric Encryption Schemes
Abstract. This paper formalizes the security adversarial games for online symmetric cryptosystems in a unified framework for deterministic and probabilistic encryption schemes. On...
Pierre-Alain Fouque, Antoine Joux, Guillaume Poupa...
APLAS
2008
ACM
13 years 10 months ago
The Complexity of Coverage
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...
Krishnendu Chatterjee, Luca de Alfaro, Rupak Majum...
IPCO
1998
99views Optimization» more  IPCO 1998»
13 years 9 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
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...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
PAMI
2006
146views more  PAMI 2006»
13 years 7 months ago
Attention-Based Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Bounds
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...
Tamar Avraham, Michael Lindenbaum
ANOR
2005
120views more  ANOR 2005»
13 years 7 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
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...
Krishna Chepuri, Tito Homem-de-Mello