1952 search results - page 260 / 391 » Complete partitions of graphs |
212
click to vote
AUSAI
2008
Springer
15 years 8 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 ...
183
click to vote
GIS
2007
ACM
15 years 10 months ago
2007
ACM
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
151
click to vote
DM
2008
15 years 6 months ago
2008
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
173
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
Abstract— This paper presents techniques that enhance automatically generated hardware assertion checkers to facilitate debugging within the assertion-based verification paradig...
186
click to vote
ICCS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This paper has two foci that are intended to be complementary. First, it describes Conzilla as an incarnation of a concept browser. More specifically, as a technical sol...