206 search results - page 23 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
KI
2001
Springer
15 years 2 months ago
2001
Springer
Abstract Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled...
DBISP2P
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. We study the problem of evaluating RDF queries over structured overlay networks. We consider the publish/subscribe scenario where nodes subscribe with long-standing queri...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
87
Voted
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...