Sciweavers

6045 search results - page 30 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
CDC
2008
IEEE
123views Control Systems» more  CDC 2008»
14 years 2 months ago
Reachability analysis of nonlinear systems with uncertain parameters using conservative linearization
— Given an initial set of a nonlinear system with uncertain parameters and inputs, the set of states that can possibly be reached is computed. The approach is based on local line...
Matthias Althoff, Olaf Stursberg, Martin Buss
SOFSEM
2009
Springer
14 years 4 months ago
On Some SAT-Variants over Linear Formulas
Informationen zum TheorieTag und Abstracts zu den Beitr¨agen finden Sie unter http://www.uni-ulm.de/in/theo/tt56.html.
Stefan Porschen, Tatjana Schmidt
NDJFL
1998
81views more  NDJFL 1998»
13 years 7 months ago
An Undecidable Linear Order That Is n-Decidable for All n
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
John Chisholm, Michael Moses
ICALP
2009
Springer
14 years 8 months ago
The Tile Complexity of Linear Assemblies
Harish Chandran, Nikhil Gopalkrishnan, John H. Rei...