1977 search results - page 243 / 396 » The satisfactory partition problem |
169
click to vote
AUSAI
2008
Springer
15 years 6 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
148
click to vote
ALENEX
2008
15 years 5 months ago
2008
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
122
click to vote
RSS
2007
15 years 5 months ago
2007
Abstract— We address the problem of surveillance in an environment with obstacles. We show that the problem of tracking an evader with one pursuer around one corner is completely...
143
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
In distributed data mining models, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose...
167
click to vote
COMBINATORICA
2010
14 years 11 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...