1594 search results - page 212 / 319 » An Algorithm to Compute Collusion Paths |
144
Voted
MOBIHOC
2001
ACM
16 years 3 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
95
Voted
IROS
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract – Presented in this paper is an approach to realtime spatial reasoning for manipulative robotic tasks. When a service robot is requested to manipulate an object, it shou...
123
Voted
ICNP
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper we focus on the problems of maintaining Ad Hoc network connectivity in the presence of node mobility whilst providing globally efficient and robust routing. The com...
146
click to vote
ISSTA
2010
ACM
15 years 5 months ago
2010
ACM
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
121
Voted
EMNLP
2007
15 years 4 months ago
2007
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...