Sciweavers

96 search results - page 5 / 20
» Linearity, Non-determinism and Solvability
Sort
View
AML
2006
103views more  AML 2006»
13 years 7 months ago
Decision methods for linearly ordered Heyting algebras
Abstract. The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable;...
Roy Dyckhoff, Sara Negri
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 2 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman
CDC
2009
IEEE
139views Control Systems» more  CDC 2009»
13 years 5 months ago
Synchronization stability of complex dynamical networks with probabilistic time-varying delays
Abstract-- A kind of complex dynamical networks with timevarying coupling delays is proposed. By some transformation, the synchronization problem of the complex networks is transfe...
Hongjie Li, Dong Yue, Zhou Gu
CORR
2007
Springer
148views Education» more  CORR 2007»
13 years 7 months ago
Linear time algorithms for Clobber
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
AUTOMATICA
2006
99views more  AUTOMATICA 2006»
13 years 7 months ago
Path-following for linear systems with unstable zero dynamics
: A path-following problem for linear systems with unstable zero dynamics is solved. While the original control variable steers the system output along the path, the path parameter...
Dragan B. Dacic, Petar V. Kokotovic