Sciweavers

3356 search results - page 166 / 672
» Determining Consensus Numbers
Sort
View
WSC
2000
13 years 11 months ago
Simulation optimization using tabu search
Investigation of the performance and operation of complex systems in manufacturing or other environments, analytical models of these systems become very complicated. Because of th...
Berna Dengiz, Cigdem Alabas
AMC
2008
88views more  AMC 2008»
13 years 10 months ago
Stopping rules for box-constrained stochastic global optimization
We present three new stopping rules for Multistart based methods. The first uses a device that enables the determination of the coverage of the bounded search domain. The second i...
Isaac E. Lagaris, Ioannis G. Tsoulos
ARSCOM
2008
117views more  ARSCOM 2008»
13 years 10 months ago
Subset Counting in Trees
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
Stephan G. Wagner
CHINAF
2008
69views more  CHINAF 2008»
13 years 10 months ago
Efficient Tate pairing computation using double-base chains
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
Changan Zhao, Fangguo Zhang, Jiwu Huang
CORR
2008
Springer
197views Education» more  CORR 2008»
13 years 10 months ago
Sequential adaptive compressed sampling via Huffman codes
In this paper we introduce an information theoretic approach and use techniques from the theory of Huffman codes to construct a sequence of binary sampling vectors to determine a s...
Akram Aldroubi, Haichao Wang, Kourosh Zarringhalam