27692 search results - page 254 / 5539 » Where is ... |
138
Voted
APAL
2008
15 years 2 months ago
2008
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
95
Voted
APPML
2008
15 years 2 months ago
2008
Assume that Au = f (1) is a solvable linear equation in a Hilbert space H, A is a linear, closed, densely defined, unbounded operator in H, which is not boundedly invertible, so p...
100
Voted
AUTOMATICA
2007
15 years 2 months ago
2007
— We consider a formation control system where individual systems are controlled by a path-following design and the path variables are to be synchronized. We first show a passiv...
107
Voted
AUTOMATICA
2008
15 years 2 months ago
2008
This paper is concerned with nonuniform sampling systems, where the sampling interval is time-varying within a certain known bound. The system is transformed into a time-varying d...
128
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Transforming constraint models is an important task in recent constraint programming systems. User-understandable models are defined during the modeling phase but rewriti...