644 search results - page 70 / 129 » Decomposition Complexity |
105
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
129
click to vote
BMCBI
2010
15 years 21 days ago
2010
Background: Protein-protein interaction (PPI) plays essential roles in cellular functions. The cost, time and other limitations associated with the current experimental methods ha...
AMC
2007
15 years 22 days ago
2007
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
AI
2006
Springer
15 years 4 months ago
2006
Springer
We are interested in contributing to solving effectively a particular type of real-time stochastic resource allocation problem. Firstly, one distinction is that certain tasks may c...
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...