2125 search results - page 238 / 425 » On Graph Complexity |
99
Voted
VTC
2006
IEEE
15 years 9 months ago
2006
IEEE
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...
112
click to vote
JAIR
2008
15 years 3 months ago
2008
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
107
Voted
ICRA
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— This paper revisits the multi-robot boundary coverage problem in which a group of k robots must inspect every point on the boundary of a 2-dimensional environment. We f...
124
Voted
COORDINATION
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes com...
145
click to vote
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...