Sciweavers

2191 search results - page 324 / 439
» Improving the Efficiency of Non-Deterministic Computations
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
14 years 1 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
ICCS
1998
Springer
14 years 1 months ago
Handling Specification Knowledge Evolution Using Context Lattices
Internet-based information technologies have considerable potential for improving collaboration in professional communities. In this paper, we explain the concept of user-driven sp...
Aldo de Moor, Guy W. Mineau
MOBICOM
1997
ACM
14 years 1 months ago
Log-Time Algorithms for Scheduling Single and Multiple Channel Data Broadcast
With the increasing popularity of portable wireless computers, mechanisms to efficiently transmit information to such clients are of significant interest. The environmentundercons...
Sohail Hameed, Nitin H. Vaidya
ICNP
1996
IEEE
14 years 1 months ago
Time-Shift Scheduling: Fair Scheduling of Flows in High Speed Networks
Abstract-- We present a scheduling protocol, called TimeShift Scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a p...
Jorge Arturo Cobb, Mohamed G. Gouda, Amal El-Nahas
ICPP
1996
IEEE
14 years 1 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...