Sciweavers

9532 search results - page 1758 / 1907
» Logic, Graphs, and Algorithms
Sort
View
CODES
2003
IEEE
15 years 4 months ago
Deriving process networks from weakly dynamic applications in system-level design
We present an approach to the automatic derivation of executable Process Network specifications from Weakly Dynamic Applications. We introduce the notions of Dynamic Single Assig...
Todor Stefanov, Ed F. Deprettere
IEEEPACT
2003
IEEE
15 years 4 months ago
Resolving Register Bank Conflicts for a Network Processor
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 ...
Xiaotong Zhuang, Santosh Pande
INFOVIS
2003
IEEE
15 years 4 months ago
Multiscale Visualization of Small World Networks
Many networks under study in Information Visualization are “small world” networks. These networks first appeared in the study social networks and were shown to be relevant mod...
David Auber, Yves Chiricota, Fabien Jourdan, Guy M...
MSWIM
2003
ACM
15 years 4 months ago
Simulation of large ad hoc networks
An ad hoc network is formed by wireless mobile nodes (hosts) that operate as terminals as well as routers in the network, without any centralized administration. Research in ad ho...
Valeriy Naoumov, Thomas R. Gross
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
15 years 4 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
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 ...
Shmuel Safra, Oded Schwartz
« Prev « First page 1758 / 1907 Last » Next »