Sciweavers

6279 search results - page 76 / 1256
» Studies in Solution Sampling
Sort
View
FFA
2008
82views more  FFA 2008»
13 years 7 months ago
Asymptotic behavior of the number of solutions for non-Archimedean Diophantine approximations with restricted denominators
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Laurent formal power s...
Valérie Berthé, Hitoshi Nakada, Rie ...
CCE
2007
13 years 7 months ago
Generate Pareto optimal solutions of scheduling problems using normal boundary intersection technique
The problem of short-term scheduling under uncertainty is addressed in this paper through a multiobjective optimization framework that incorporates economic expectation, robustnes...
Zhenya Jia, Marianthi G. Ierapetritou
EC
2008
153views ECommerce» more  EC 2008»
13 years 7 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
BMCBI
2010
161views more  BMCBI 2010»
13 years 7 months ago
CGHpower: exploring sample size calculations for chromosomal copy number experiments
Background: Determining a suitable sample size is an important step in the planning of microarray experiments. Increasing the number of arrays gives more statistical power, but ad...
Ilari Scheinin, Jose A. Ferreira, Sakari Knuutila,...
CCS
2009
ACM
14 years 2 months ago
Large-scale malware indexing using function-call graphs
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...
Xin Hu, Tzi-cker Chiueh, Kang G. Shin