2994 search results - page 256 / 599 » Time sequences |
124
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— This paper presents a novel, computationally feasible procedure for computing optimal switching surfaces, i.e. optimal feedback controllers for switched autonomous nonl...
139
click to vote
CAV
2008
Springer
15 years 6 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
100
click to vote
IJCAI
2007
15 years 6 months ago
2007
Although necessary, learning to discover new solutions is often long and difficult, even for supposedly simple tasks such as counting. On the other hand, learning by imitation pr...
154
click to vote
ACL
1996
15 years 5 months ago
1996
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
147
click to vote
JCSS
2002
15 years 4 months ago
2002
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...