Sciweavers

7133 search results - page 227 / 1427
» Communication algorithms with advice
Sort
View
146
Voted
IPPS
2003
IEEE
15 years 11 months ago
A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
Carlos E. R. Alves, Edson Cáceres, Siang W....
PDP
2003
IEEE
15 years 11 months ago
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem
The paper presents a Coarse-Grained Multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with È processors in ...
Thierry Garcia, Jean Frédéric Myoupo...
WWIC
2009
Springer
157views Communications» more  WWIC 2009»
16 years 21 days ago
An Adaptive Optimized RTO Algorithm for Multi-homed Wireless Environments
As a transport layer protocol SCTP uses end to end metrics, such as Retransmission Time Out (RTO), to manage mobility handover. Our investigation illustrates that Wireless LAN (WLA...
Sheila Fallon, Paul Jacob, Yuansong Qiao, Liam Mur...
BROADCOM
2008
IEEE
16 years 18 days ago
A Routing Metric and Algorithm for IEEE802.16 Mesh Networks
— The rapid growth of high-speed multimedia services for mobile, residential and small business customers has created an increasing demand for last mile broadband access. The wir...
Ntsibane Ntlatlapa
ICCCN
2008
IEEE
16 years 17 days ago
Impairment-Aware Manycast Algorithms over Optical Burst-Switched Networks
— We discuss the effect of physical impairments on manycasting service over optical burst-switched (OBS) networks. Signal quality degradation in manycast networks is an important...
Balagangadhar G. Bathula, Rajesh R. C. Bikram, Vin...