Sciweavers

1998 search results - page 209 / 400
» Situated Control Rules
Sort
View
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 5 months ago
A resource-based Korean morphological annotation system
We describe a resource-based method of morphological annotation of written Korean text. Korean is an agglutinative language. The output of our system is a graph of morphemes annot...
Hyun-Gue Huh, Eric Laporte
POPL
2002
ACM
16 years 5 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
162
Voted
FROCOS
2009
Springer
15 years 11 months ago
Automating Theories in Intuitionistic Logic
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
Guillaume Burel
CDC
2008
IEEE
15 years 11 months ago
On the inverse scattering of star-shape LC-networks
— The study of the scattering data for a star-shape network of LC-transmission lines is transformed into the scattering analysis of a Schr¨odinger operator on the same graph. Th...
Filippo Visco-Comandini, Mazyar Mirrahimi, Michel ...
158
Voted
CDC
2008
IEEE
119views Control Systems» more  CDC 2008»
15 years 11 months ago
A set-membership approach to consensus problems with bounded measurement errors
— This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The protocols taken into account adopt an updating rule based either on const...
Andrea Garulli, Antonio Giannitrapani