448 search results - page 61 / 90 » The Complexity of Codiagnosability for Discrete Event and Ti... |
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— In this paper, two problems related to the simulation of virtual environments for haptic systems are considered. The first problem is how to simulate, in discrete time...
SIMPRA
2008
13 years 7 months ago
2008
: DEVS is a Modeling and Simulation formalism that has been widely used to study the dynamics of discrete event systems. Cell-DEVS is a DEVS-based formalism that defines spatial mo...
COMPGEOM
2010
ACM
14 years 23 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
JIRS
2008
13 years 7 months ago
2008
Abstract This paper proposes an approach for reducing the computational complexity of a model-predictive-control strategy for discrete-time hybrid systems with discrete inputs only...