2899 search results - page 134 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
130
click to vote
IPPS
1997
IEEE
15 years 9 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 ...
175
click to vote
JMLR
2010
15 years 3 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...
195
click to vote
GLOBECOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
143
Voted
AAAI
2008
15 years 7 months ago
2008
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many auth...
144
click to vote
SIROCCO
1998
15 years 6 months ago
1998
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...