Sciweavers

5440 search results - page 730 / 1088
» Adapting Applications on the Fly
Sort
View
AML
2010
99views more  AML 2010»
15 years 7 months ago
Effectively inseparable Boolean algebras in lattices of sentences
We show the non-arithmeticity of 1st order theories of lattices of n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithm...
V. Yu. Shavrukov
APAL
2008
104views more  APAL 2008»
15 years 7 months ago
Infinite trace equivalence
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...
Paul Blain Levy
AUTOMATICA
2008
82views more  AUTOMATICA 2008»
15 years 7 months ago
Iterative minimization of H2 control performance criteria
Data-based control design methods most often consist of iterative adjustment of the controller's parameters towards the parameter values which minimize an H2 performance crit...
Alexandre S. Bazanella, Michel Gevers, Ljubisa Mis...
COR
2008
128views more  COR 2008»
15 years 7 months ago
Search-based software engineering
In the past five years there has been a dramatic increase in work on Search Based Software Engineering (SBSE), an approach to software engineering in which search based optimisatio...
Walter J. Gutjahr, Mark Harman
CORR
2008
Springer
77views Education» more  CORR 2008»
15 years 7 months ago
A Reconfigurable Impedance Matching Network Employing RF-MEMS Switches
We propose the design of a reconfigurable impedance matching network for the lower RF frequency band, based on a developed RF-MEMS technology. The circuit is composed of RF-MEMS o...
Marco Bedani, F. Carozza, Roberto Gaddi, Antonio G...