6045 search results - page 37 / 1209 » Computable Linearizations of Well-partial-orderings |
SBRN
2008
IEEE
14 years 2 months ago
2008
IEEE
The design of an autonomous navigation system for mobile robots can be a tough task. Noisy sensors, unstructured environments and unpredictability are among the problems which mus...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
FAW
2009
Springer
14 years 2 months ago
2009
Springer
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
PPOPP
2010
ACM
14 years 5 months ago
2010
ACM
This poster is a case study on the application of a novel programming model, called Concurrent Collections (CnC), to the implementation of an asynchronous-parallel algorithm for c...