Sciweavers

116 search results - page 13 / 24
» Solving network design problems via iterative aggregation
Sort
View
JCO
2010
101views more  JCO 2010»
15 years 2 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
161
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
Kostas Christodoulopoulos, Konstantinos Manousakis...
169
Voted
CONEXT
2006
ACM
15 years 10 months ago
Reconciling zero-conf with efficiency in enterprises
A conventional enterprise or campus network comprises Ethernet-based IP subnets interconnected by routers. Although each subnet runs with minimal (or zero) configuration by virtue...
Chang Kim, Jennifer Rexford
DAC
1996
ACM
15 years 8 months ago
A Sparse Image Method for BEM Capacitance Extraction
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions. ...
Byron Krauter, Yu Xia, E. Aykut Dengi, Lawrence T....
ITS
1998
Springer
139views Multimedia» more  ITS 1998»
15 years 8 months ago
Habitable 3D Learning Environments for Situated Learning
The growing emphasis on learner-centered education focuses on intrinsically motivated learning via engaging problem-solving activities. Habitable 3D learning environments, in which...
William H. Bares, Luke S. Zettlemoyer, James C. Le...