303 search results - page 8 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
DCOSS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the problem of estimating vector-valued variables from noisy "relative" measurements. The measurement model can be expressed in terms of a graph, wh...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
SPIN
2007
Springer
14 years 1 months ago
2007
Springer
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
AMAI
2008
Springer
13 years 7 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
WG
2007
Springer
14 years 1 months ago
2007
Springer
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...