Sciweavers

303 search results - page 7 / 61
» Computing Minimal Spanning Subgraphs in Linear Time
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
Memory minimization for tensor contractions using integer linear programming
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
A. Allam, J. Ramanujam, Gerald Baumgartner, P. Sad...
RANDOM
2001
Springer
13 years 12 months ago
Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
Susanne Albers, Carsten Witt
GECCO
1999
Springer
116views Optimization» more  GECCO 1999»
13 years 11 months ago
Dynamic Degree Constrained Network Design: A Genetic Algorithm Approach
The design and development of network infrastructure to support mission-critical operations has become a critical and complicated issue. In this study we explore the use of geneti...
Chao-Hsien Chu, G. Premkumar, Carey Chou, Jianzhon...
GD
2006
Springer
13 years 11 months ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel
JSCIC
2007
165views more  JSCIC 2007»
13 years 7 months ago
A Nonlinear Multigrid Method for Total Variation Minimization from Image Restoration
Image restoration has been an active research topic and variational formulations are particularly effective in high quality recovery. Although there exist many modelling and theore...
Ke Chen 0002, Xue-Cheng Tai