149 search results - page 5 / 30 » Solving large scale combinatorial optimization using PMA-SLS |
IJRR
2006
14 years 11 months ago
2006
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization t...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
100
click to vote
EUROCAST
2009
Springer
15 years 6 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
PDCN
2004
15 years 1 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
NIPS
2007
15 years 1 months ago
2007
This paper investigates the application of randomized algorithms for large scale SVM learning. The key contribution of the paper is to show that, by using ideas random projections...