Sciweavers

299 search results - page 45 / 60
» DNA Computing for Complex Scheduling Problem
Sort
View
IPPS
2007
IEEE
15 years 6 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
NOSSDAV
2004
Springer
15 years 5 months ago
Reduced state fair queuing for edge and core routers
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
Ramana Rao Kompella, George Varghese
CSIE
2009
IEEE
14 years 9 months ago
The Pilot Way to Grid Resources Using glideinWMS
Grid computing has become very popular in big and widespread scientific communities with high computing demands, like high energy physics. Computing resources are being distribute...
Igor Sfiligoi, Daniel C. Bradley, Burt Holzman, Pa...
PPSN
2000
Springer
15 years 3 months ago
Optimizing through Co-evolutionary Avalanches
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...
CCGRID
2009
IEEE
15 years 24 days ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li