3146 search results - page 493 / 630 » Efficient Consequence Finding |
119
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The application of genetic algorithms (GAs) to many optimization problems in organizations often results in good performance and high quality solutions. For successful and efficien...
111
click to vote
DAM
2010
15 years 3 months ago
2010
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2...
117
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
For a given prime p, a new construction of families of the complex valued sequences of period p with efficient implementation is given by applying both multiplicative characters a...
139
Voted
CSDA
2008
15 years 3 months ago
2008
It is shown that any pair of scatter and spatial scatter matrices yields an estimator of the separating matrix for complex-valued independent component analysis (ICA). Scatter (re...
118
click to vote
ALMOB
2006
15 years 3 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...