1986 search results - page 274 / 398 » Path Separability of Graphs |
113
Voted
IROS
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
100
Voted
CCS
2007
ACM
15 years 8 months ago
2007
ACM
: To understand overall vulnerability to network attack, one must consider attacker exploits not just in isolation, but also in combination. That is, one must analyze how low-level...
144
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
128
click to vote
MOZ
2004
Springer
15 years 8 months ago
2004
Springer
The analysis of biochemical networks consists in studying the interactions between biological entities cooperating in complex cellular processes. To facilitate the expression of an...
111
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...