Sciweavers

194 search results - page 12 / 39
» Gathering Algorithms on Paths Under Interference Constraints
Sort
View
DAC
2006
ACM
14 years 8 months ago
An efficient and versatile scheduling algorithm based on SDC formulation
Scheduling plays a central role in the behavioral synthesis process, which automatically compiles high-level specifications into optimized hardware implementations. However, most ...
Jason Cong, Zhiru Zhang
WASA
2009
Springer
132views Algorithms» more  WASA 2009»
14 years 2 months ago
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks
Abstract. This paper is motivated by exploring the impact of the number of channels on the achievable communication latency for a specific communication task. We focus on how to u...
Peng-Jun Wan, Zhu Wang, Zhiyuan Wan, Scott C.-H. H...
TON
1998
186views more  TON 1998»
13 years 7 months ago
Virtual path control for ATM networks with call level quality of service guarantees
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
Nikolaos Anerousis, Aurel A. Lazar
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 1 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
ADHOC
2007
107views more  ADHOC 2007»
13 years 7 months ago
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
Weifa Liang, Yuzhen Liu