18 search results - page 3 / 4 » Efficient Recovery from False State in Distributed Routing A... |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
CN
2004
13 years 7 months ago
2004
Label switched networks have become increasingly attractive to both network providers and customers. By creating aggregate, bandwidth-reserved flows, these networks offer routing ...
CIC
2003
13 years 9 months ago
2003
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
FPGA
2004
ACM
13 years 11 months ago
2004
ACM
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
We develop a novel mechanism for coordinated, distributed multiagent planning. We consider problems stated as a collection of single-agent planning problems coupled by common soft...