153 search results - page 26 / 31 » Minimum cost subpartitions in graphs |
104
click to vote
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
129
click to vote
FPGA
2008
ACM
15 years 1 months ago
2008
ACM
Pattern-based synthesis has drawn wide interest from researchers who tried to utilize the regularity in applications for design optimizations. In this paper we present a general p...
ILP
2004
Springer
15 years 5 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
137
click to vote
TASE
2010
IEEE
14 years 6 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...