1749 search results - page 115 / 350 » Conditional colorings of graphs |
167
click to vote
ECRTS
2007
IEEE
16 years 26 days ago
2007
IEEE
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend ...
170
click to vote
SIROCCO
2000
15 years 7 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
177
click to vote
DM
1999
15 years 6 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
158
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
The conventional histogram intersection (HI) algorithm computes the intersected section of the corresponding color histograms in order to measure the matching rate between two col...
172
click to vote
ROBOCUP
1998
Springer
15 years 10 months ago
1998
Springer
The Osaka Legged Robot Team, BabyTigers-98, attended the First Sony Legged Robot Competition and Demonstration which was held at La Cite La Villeta, a science and technology museum...