441 search results - page 34 / 89 » Refinement of Time |
IJFCS
2006
13 years 8 months ago
2006
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
AIME
1997
Springer
14 years 25 days ago
1997
Springer
: Clinical guidelines reuse existing clinical procedural knowledge while leaving room for flexibility by the care provider applying that knowledge. Guidelines can be viewed as gene...
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
FUIN
2008
13 years 8 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...