5595 search results - page 400 / 1119 » Approximation Algorithms for Clustering Problems |
195
Voted
OL
2007
15 years 6 months ago
2007
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
169
click to vote
IJPP
2008
15 years 6 months ago
2008
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, an...
182
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
203
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
High throughput biotechnologies have enabled scientists to collect a large number of genetic and phenotypic attributes for a large collection of samples. Computational methods are...
186
click to vote
SOFSEM
2007
Springer
16 years 28 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...