1986 search results - page 346 / 398 » Path Separability of Graphs |
IEEEPACT
2003
IEEE
14 years 28 days ago
2003
IEEE
This paper discusses a register bank assignment problem for a popular network processor--Intel's IXP. Due to limited data paths, the network processor has a restriction that ...
INFOCOM
2003
IEEE
14 years 28 days ago
2003
IEEE
— Service discovery is an integral part of the ad hoc networking to achieve stand-alone and self-configurable communication networks. In this paper, we discuss possible service ...
ESA
2003
Springer
14 years 26 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
ICDCS
2002
IEEE
14 years 18 days ago
2002
IEEE
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
IEEEPACT
2002
IEEE
14 years 17 days ago
2002
IEEE
Java exception checks are designed to ensure that any faulting instruction causing a hardware exception does not terminate the program abnormally. These checks, however, impose so...