1363 search results - page 170 / 273 » The road coloring problem |
157
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
Requirements of reactive systems are usually specified by classifying system executions as desirable and undesirable. To specify prioritized requirements, we propose to associate a...
167
click to vote
EJC
2010
15 years 6 months ago
2010
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
178
click to vote
JCT
2006
15 years 6 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
147
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
183
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper presents a new approach to imaging that significantly enhances the dynamic range of a camera. The key idea is to adapt the exposure of each pixel on the image detector,...