Sciweavers

701 search results - page 30 / 141
» An Ant Algorithm for the Steiner Tree Problem in Graphs
Sort
View
ICCAD
1998
IEEE
81views Hardware» more  ICCAD 1998»
13 years 11 months ago
A simultaneous routing tree construction and fanout optimization algorithm
- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
Amir H. Salek, Jinan Lou, Massoud Pedram
CIKM
2006
Springer
13 years 11 months ago
A system for query-specific document summarization
There has been a great amount of work on query-independent summarization of documents. However, due to the success of Web search engines query-specific document summarization (que...
Ramakrishna Varadarajan, Vagelis Hristidis
NETWORKING
2007
13 years 8 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen
DAM
2006
191views more  DAM 2006»
13 years 7 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
ICPP
2005
IEEE
14 years 1 months ago
An ACO-Based Approach for Scheduling Task Graphs with Communication Costs
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Markus Bank, Udo Hönig, Wolfram Schiffmann