4037 search results - page 296 / 808 » Routing without ordering |
127
click to vote
INFOVIS
2003
IEEE
15 years 8 months ago
2003
IEEE
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...
109
click to vote
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
One of the most important issues to deal with in peerto-peer networks is how to disseminate information. In this paper, we use a completely new approach to solving the information...
126
click to vote
IMC
2003
ACM
15 years 8 months ago
2003
ACM
Internet Service Providers (ISPs) can exploit path diversity to balance load and improve robustness. Unfortunately, it is difficult to evaluate the potential impact of these appr...
136
click to vote
SASN
2003
ACM
15 years 8 months ago
2003
ACM
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
117
click to vote
ICTCS
2003
Springer
15 years 8 months ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...