1952 search results - page 95 / 391 » Complete partitions of graphs |
130
click to vote
IROS
2007
IEEE
15 years 10 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 ...
157
click to vote
COLOGNETWENTE
2010
15 years 29 days ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
130
click to vote
IJFCS
2006
15 years 4 months ago
2006
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
161
click to vote
CALCO
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Model-to-model (M2M) transformation consists in transforming models from a source to a target language. Many transformation languages exist, but few of them combine a dec...
137
click to vote
ICRA
2002
IEEE
15 years 9 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...