1447 search results - page 213 / 290 » Graphs and Path Equilibria |
168
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
141
click to vote
AGILE
2009
Springer
16 years 29 days ago
2009
Springer
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
145
click to vote
FMCAD
2009
Springer
16 years 28 days ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
192
click to vote
BIBE
2007
IEEE
16 years 22 days ago
2007
IEEE
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...
150
click to vote
IROS
2007
IEEE
16 years 20 days 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 ...