13987 search results - page 656 / 2798 » The Two Guards Problem |
179
click to vote
MST
2007
15 years 7 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
177
click to vote
IPL
2010
15 years 6 months ago
2010
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
181
click to vote
JAT
2010
15 years 6 months ago
2010
The paper investigates the properties of certain biorthogonal polynomials appearing in a specific simultaneous Hermite–Pad´e approximation scheme. Associated with any totally ...
173
click to vote
SMC
2010
IEEE
15 years 5 months ago
2010
IEEE
—Distance aware tag clouds add visualization of relations between terms to standard tag clouds. In addition to term importance (which is usually depicted through font size) the p...
197
click to vote
ATMOS
2010
15 years 5 months ago
2010
Traditionally, the coordination of multiple traffic signals and the traffic assignment problem in an urban street network are considered as two separate optimization problems. How...