Sciweavers

158 search results - page 6 / 32
» On Complexity of Optimal Recombination for Binary Representa...
Sort
View
ICA
2004
Springer
14 years 1 months ago
Blind Deconvolution of SISO Systems with Binary Source Based on Recursive Channel Shortening
We treat the problem of Blind Deconvolution of Single Input - Single Output (SISO) systems with real or complex binary sources. We explicate the basic mathematical idea by focusing...
Konstantinos I. Diamantaras, Theophilos Papadimitr...
DSN
2005
IEEE
14 years 1 months ago
A Wavefront Parallelisation of CTMC Solution Using MTBDDs
In this paper, we present a parallel implementation for the steady-state analysis of continuous-time Markov chains (CTMCs). This analysis is performed via solution of a linear equ...
Yi Zhang, David Parker, Marta Z. Kwiatkowska
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
13 years 11 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
AAAI
1998
13 years 9 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
WSC
2008
13 years 10 months ago
Simulation optimization for industrial scheduling using hybrid genetic representation
Simulation modeling has the capability to represent complex real-world systems in details and therefore it is suitable to develop simulation models for generating detailed operati...
Marcus Andersson, Amos Ng, Henrik Grimm