1520 search results - page 74 / 304 » The Ring Loading Problem |
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm i...
101
click to vote
COMSWARE
2007
IEEE
15 years 4 months ago
2007
IEEE
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
SC
2009
ACM
15 years 4 months ago
2009
ACM
Irregular and dynamic parallel applications pose significant challenges to achieving scalable performance on large-scale multicore clusters. These applications often require ongo...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
107
click to vote
NOMS
2006
IEEE
15 years 4 months ago
2006
IEEE
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...