2526 search results - page 272 / 506 » A Comparative Evaluation of Name-Matching Algorithms |
126
Voted
PADS
2004
ACM
15 years 10 months ago
2004
ACM
Parallel discrete event simulation techniques have enabled the realization of large-scale models of communication networks containing millions of end hosts and routers. However, t...
138
click to vote
SIGCOMM
2004
ACM
15 years 10 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
142
click to vote
RTCSA
2003
IEEE
15 years 9 months ago
2003
IEEE
Previous real-time disk scheduling algorithms assume that each disk request incurs a disk mechanical operation and only consider how to move the disk head under real-time constrain...
140
click to vote
GIS
2009
ACM
15 years 9 months ago
2009
ACM
This paper looks at the problem of data prioritization, commonly found in mobile ad-hoc networks. The proposed general solution uses a machine learning approach in order to learn ...
147
Voted
AOSD
2007
ACM
15 years 8 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...