232 search results - page 29 / 47 » Termination of linear bounded term rewriting systems |
CDC
2009
IEEE
14 years 10 days ago
2009
IEEE
— In this paper we use bilevel programming to find the maximum difference between a reference controller and a low-complexity controller in terms of the infinitynorm difference...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
JLP
2010
13 years 2 months ago
2010
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
We address the consensus-based distributed linear filtering problem, where a discrete time, linear stochastic process is observed by a network of sensors. We assume that the consen...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...