706 search results - page 75 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
HIS
2009
13 years 6 months ago
2009
This paper presents a novel optimization approach using Improved Harmony Search (IHS) algorithm to solve economic power dispatch problem. The proposed methodology easily takes care...
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
COLT
2006
Springer
14 years 19 days ago
2006
Springer
Abstract. We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolut...
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a me...
IJCM
2002
13 years 8 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...