Sciweavers

186 search results - page 26 / 38
» Priority Algorithms for the Subset-Sum Problem
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
Fair background data transfers of minimal delay impact
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
Costas Courcoubetis, Antonis Dimakis
AGENTS
2000
Springer
13 years 11 months ago
A game-theoretic formulation of multi-agent resource allocation
This paper considers resource allocation in a network with mobile agents competing for computational priority. We formulate this problem as a multi-agent game with the players bei...
Jonathan Bredin, Rajiv T. Maheswaran, Çagri...
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
13 years 9 months ago
Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
Torsten Hildebrandt, Jens Heger, Bernd Scholz-Reit...
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 5 months ago
Multi-Criteria Evaluation of Partitioning Schemes for Real-Time Systems
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
Irina Lupu, Pierre Courbin, Laurent George, Jo&eum...
ICCAD
2010
IEEE
176views Hardware» more  ICCAD 2010»
13 years 5 months ago
An auction based pre-processing technique to determine detour in global routing
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...
Yue Xu, Chris Chu