3049 search results - page 238 / 610 » On the Convergence of Bound Optimization Algorithms |
180
click to vote
SIAMCO
2002
15 years 6 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
191
click to vote
RTSS
2005
IEEE
16 years 4 days ago
2005
IEEE
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
232
click to vote
FMSB
2008
15 years 8 months ago
2008
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
177
click to vote
INFOCOM
2006
IEEE
16 years 17 days ago
2006
IEEE
— This paper analyzes and designs medium access control (MAC) protocols for wireless ad-hoc networks through the network utility maximization (NUM) framework. We first reverse-e...
156
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...