Sciweavers

4377 search results - page 634 / 876
» Mass problems and randomness
Sort
View
EOR
2006
68views more  EOR 2006»
15 years 6 months ago
Modelling complex assemblies as a queueing network for lead time control
In this paper we develop an open queueing network for optimal design of multi-stage assemblies, in which each service station represents a manufacturing or assembly operation. The...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
JCS
2008
93views more  JCS 2008»
15 years 6 months ago
On the Bayes risk in information-hiding protocols
Randomized protocols for hiding private information can be regarded as noisy channels in the information-theoretic sense, and the inference of the concealed information can be reg...
Konstantinos Chatzikokolakis, Catuscia Palamidessi...
JOC
2008
92views more  JOC 2008»
15 years 6 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay
JSAT
2008
113views more  JSAT 2008»
15 years 6 months ago
Combining Adaptive and Dynamic Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
JCO
2006
126views more  JCO 2006»
15 years 6 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...