Sciweavers

4131 search results - page 205 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
101
Voted
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
15 years 10 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
AI
2007
Springer
15 years 3 months ago
Determining the consistency of partial tree descriptions
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
Manuel Bodirsky, Martin Kutz
AUTOMATICA
2006
91views more  AUTOMATICA 2006»
15 years 3 months ago
Necessary and sufficient conditions for reachability on a simplex
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
Bartek Roszak, Mireille E. Broucke
TAMC
2009
Springer
15 years 10 months ago
On Parameterized Exponential Time Complexity
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
Jianer Chen, Iyad A. Kanj, Ge Xia
113
Voted
SIAMCO
2002
77views more  SIAMCO 2002»
15 years 3 months ago
Robust Optimal Switching Control for Nonlinear Systems
Abstract. We formulate a robust optimal control problem for a general nonlinear system with finitely many admissible control settings and with costs assigned to switching of contro...
Joseph A. Ball, Jerawan Chudoung, Martin V. Day