287 search results - page 48 / 58 » Communication complexity as a lower bound for learning in ga... |
GLOBECOM
2009
IEEE
14 years 3 months ago
2009
IEEE
— In this paper, we provide a lower and upper bound for the number of degrees of freedom (DOF) of B multipleinput single-output (MISO) broadcast channels (BC) where each base sta...
ICDCS
2009
IEEE
14 years 5 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
GECCO
2006
Springer
14 years 8 days ago
2006
Springer
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
ICML
1999
IEEE
14 years 28 days ago
1999
IEEE
Developing automated agents that intelligently perform complex real world tasks is time consuming and expensive. The most expensive part of developing these intelligent task perfo...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...