7006 search results - page 525 / 1402 » Approximation Algorithms |
171
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
193
click to vote
PAMI
2008
15 years 6 months ago
2008
Variational Bayesian Expectation-Maximization (VBEM), an approximate inference method for probabilistic models based on factorizing over latent variables and model parameters, has ...
201
click to vote
TMC
2010
15 years 4 months ago
2010
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
186
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
189
click to vote
IPL
2007
15 years 6 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...