4565 search results - page 208 / 913 » Time Optimal Self-Stabilizing Algorithms |
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
CEC
2010
IEEE
15 years 1 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
121
Voted
JMLR
2010
14 years 11 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
105
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
100
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...