Sciweavers

327 search results - page 37 / 66
» Algorithms for infinite huffman-codes
Sort
View
CAV
2006
Springer
128views Hardware» more  CAV 2006»
13 years 11 months ago
Safraless Compositional Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, litt...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
FPL
2006
Springer
98views Hardware» more  FPL 2006»
13 years 11 months ago
Self-Reconfigurable Pervasive Platform for Cryptographic Application
The complexity exhibited by pervasive systems is constantly increasing. Customer electronics devices provide day to day a larger amount of functionalities. A common approach for g...
Arnaud Lagger, Andres Upegui, Eduardo Sanchez, Iva...
WFLP
2000
Springer
82views Algorithms» more  WFLP 2000»
13 years 11 months ago
Strong and NV-sequentiality of constructor systems
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
Salvador Lucas
CCS
2008
ACM
13 years 9 months ago
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
Cas J. F. Cremers
NIPS
2004
13 years 8 months ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg