Sciweavers

1259 search results - page 211 / 252
» The load rebalancing problem
Sort
View
IPPS
1997
IEEE
14 years 1 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
CCR
2010
102views more  CCR 2010»
13 years 9 months ago
FIE: future internet enervation
I'm so Bored of the Future Internet (FI). There are so many initiatives to look at the Internet's Future1 , anyone would think that there was some tremendous threat like...
Jon Crowcroft
CGF
2008
80views more  CGF 2008»
13 years 9 months ago
A Semi-Lagrangian CIP Fluid Solver without Dimensional Splitting
In this paper, we propose a new constrained interpolation profile (CIP) method that is stable and accurate but requires less amount of computation compared to existing CIP-based s...
Doyub Kim, Oh-Young Song, Hyeong-Seok Ko
TMC
2002
118views more  TMC 2002»
13 years 8 months ago
Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management
The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two importan...
Yu-Chee Tseng, Chih-Min Chao
ATMOS
2010
183views Optimization» more  ATMOS 2010»
13 years 7 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel