3049 search results - page 118 / 610 » On the Convergence of Bound Optimization Algorithms |
127
Voted
SASO
2009
IEEE
15 years 11 months ago
2009
IEEE
—We consider here multi-agent patrolling as the task for a group of agents to repeatedly visit all the cells of a discrete environment. Wagner et al. [1] have introduced patrolli...
151
click to vote
TIT
2010
14 years 11 months ago
2010
We study the use of low-density generator matrix (LDGM) codes for lossy compression of the Bernoulli symmetric source. First, we establish rigorous upper bounds on the average dist...
134
click to vote
ISHPC
2003
Springer
15 years 9 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
129
click to vote
ORL
2008
15 years 4 months ago
2008
This paper presents an algorithm that converges to points that satisfy a first order necessary condition of weakly Pareto solutions of multiobjective optimization problems. Hints ...
137
Voted
ISPD
2003
ACM
15 years 9 months ago
2003
ACM
In 21st-Century VLSI design, clocking plays crucial roles for both performance and timing convergence. Due to their non-convex nature, optimal minimum-delay/area zero-skew wire-si...