1282 search results - page 46 / 257 » Algorithms for Large, Sparse Network Alignment Problems |
ICPP
1998
IEEE
13 years 12 months ago
1998
IEEE
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
ICANNGA
2009
Springer
14 years 10 days ago
2009
Springer
The problem we address in this paper is that of finding effective and parsimonious patterns of connectivity in sparse associative memories. This problem must be addressed in real n...
SC
1995
ACM
1995
ACM
Parallel Implementations of the Power System Transient Stability Problem on Clusters of Workstations
13 years 11 months ago
Power system transient stability analysis computes the response of the rapidly changing electrical components of a power system to a sequence of large disturbances followed by ope...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...