2254 search results - page 187 / 451 » Computing the minimal covering set |
165
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, r...
175
Voted
AUTOMATICA
2008
15 years 6 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
135
click to vote
MST
2006
15 years 6 months ago
2006
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
175
click to vote
ENTCS
2002
15 years 6 months ago
2002
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...