3206 search results - page 436 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
94
Voted
SIGCOMM
2009
ACM
15 years 8 months ago
2009
ACM
Application-independent Redundancy Elimination (RE), or identifying and removing repeated content from network transfers, has been used with great success for improving network pe...
191
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
101
Voted
AIIDE
2008
15 years 4 months ago
2008
We explore the task of designing an efficient multi-agent system that is capable of capturing a single moving target, assuming that every agent knows the location of all agents on...
123
click to vote
JUCS
2010
15 years 21 days ago
2010
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
133
click to vote
ATMOS
2010
15 years 1 months ago
2010
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...