186 search results - page 12 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we study the dynamic RWA problem in WDM networks with sparse wavelength conversion and propose a novel hybrid algorithm for it based on the combination of mobile ag...
SIAMSC
2010
13 years 6 months ago
2010
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...
ISSAC
1997
Springer
13 years 11 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
EVOW
2003
Springer
14 years 23 days ago
2003
Springer
Evolutionary Algorithms (EAs) have been proposed as a very powerful heuristic optimization technique to solve complex problems. Many case studies have shown that they work very eff...
TKDE
2012
11 years 10 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...