4266 search results - page 71 / 854 » The container loading problem |
ISAAC
2007
Springer
14 years 4 months ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
WAOA
2005
Springer
14 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...
SC
2009
ACM
14 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
14 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...
NOMS
2006
IEEE
14 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...