942 search results - page 25 / 189 » Structured decomposition of adaptive applications |
278
click to vote
SDM
2011
SIAM
14 years 6 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
130
Voted
IJRR
2008
15 years 3 months ago
2008
This paper deals with minimum time trajectory optimization along a specified path subject to thermal constraints. We point out here that robots are often integrated in complex rob...
180
click to vote
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—Social networks exhibit a very special property: community structure. Understanding the network community structure is of great advantages. It not only provides helpful informat...
188
click to vote
WEA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
131
Voted
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...