16404 search results - page 128 / 3281 » A set coverage problem |
CORR
2008
Springer
15 years 3 months ago
2008
Springer
: In this paper, our focus is on certain applications for mobile robotic networks, where reconfiguration is driven by factors intrinsic to the network rather than changes in the ex...
151
click to vote
ASPDAC
2011
ACM
14 years 6 months ago
2011
ACM
— Code coverage is a popular method to find design bugs and verification loopholes. However, once a piece of code is determined to be unreachable, diagnosing the cause of the p...
146
click to vote
IJRR
2006
15 years 3 months ago
2006
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
116
click to vote
EDCC
2006
Springer
15 years 7 months ago
2006
Springer
- This paper proposes a novel technique for preventing a wide range of data errors from corrupting the execution of applications. The proposed technique enables automated derivatio...
122
click to vote
EVOW
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...