Sciweavers

2600 search results - page 199 / 520
» Clustering with or without the Approximation
Sort
View
ACMICEC
2007
ACM
102views ECommerce» more  ACMICEC 2007»
15 years 10 months ago
Learning to trade with insider information
This paper introduces algorithms for learning how to trade using insider (superior) information in Kyle's model of financial markets. Prior results in finance theory relied o...
Sanmay Das
APN
2006
Springer
15 years 10 months ago
A New Approach to the Evaluation of Non Markovian Stochastic Petri Nets
Abstract. In this work, we address the problem of transient and steadystate analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but ...
Serge Haddad, Lynda Mokdad, Patrice Moreaux
CEC
2008
IEEE
15 years 8 months ago
Automated solution selection in multi-objective optimisation
This paper proposes an approach to the solution of multi-objective optimisation problems that delivers a single, preferred solution. A conventional, population-based, multiobjectiv...
Andrew Lewis, David Ireland
AIA
2007
15 years 8 months ago
Optimizing number of hidden neurons in neural networks
In this paper, a novel and effective criterion based on the estimation of the signal-to-noise-ratio figure (SNRF) is proposed to optimize the number of hidden neurons in neural ne...
Yue Liu, Janusz A. Starzyk, Zhen Zhu
COCOON
2010
Springer
15 years 5 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen