2294 search results - page 170 / 459 » From Path Graphs to Directed Path Graphs |
WADS
2007
Springer
15 years 4 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
ECAI
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
— This paper is concerned with path planning for an autonomous flight vehicle operating in a steady, uniform flow-field. We model the vehicle as a particle that travels in the...
95
Voted
DCC
2011
IEEE
14 years 5 months ago
2011
IEEE
We show that (n, 2n ) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to ...