8917 search results - page 266 / 1784 » Abstraction in Algorithm Animation |
117
click to vote
ANOR
2011
14 years 10 months ago
2011
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
147
Voted
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract-- We study the convergence rate of average consensus algorithms in networks with stochastic communication failures. We show how the system dynamics can be modeled by a dis...
140
Voted
SAC
2011
ACM
14 years 10 months ago
2011
ACM
Abstract In many statistical problems, maximum likelihood estimation by an EM or MM algorithm suffers from excruciatingly slow convergence. This tendency limits the application of ...
161
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
154
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...