4266 search results - page 203 / 854 » The container loading problem |
142
click to vote
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
127
Voted
PARA
1995
Springer
15 years 7 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
140
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to...
115
click to vote
BCSHCI
2007
15 years 5 months ago
2007
The Creative Problem-Solving Research Group (CPSRG) at Lancaster University is a collaboration between psychologists and computer scientists conducting research into creativity, p...
126
click to vote
TON
2008
15 years 4 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...