Sciweavers

5981 search results - page 75 / 1197
» time 2006
Sort
View
JAPLL
2006
90views more  JAPLL 2006»
13 years 11 months ago
Definability and decidability of binary predicates for time granularity
In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures...
Massimo Franceschet, Angelo Montanari, Adriano Per...
FMSD
2007
97views more  FMSD 2007»
13 years 11 months ago
On the optimal reachability problem of weighted timed automata
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
Patricia Bouyer, Thomas Brihaye, Véronique ...
NETWORKS
2010
13 years 9 months ago
Mixed search number and linear-width of interval and split graphs
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
JUCS
2006
138views more  JUCS 2006»
13 years 11 months ago
Analysing Data of Childhood Acute Lymphoid Leukaemia by Seasonal Time Series Methods
: We examined the periodicity of the childhood leukaemia in Hungary using seasonal decomposition time series. Between 1988 and 2000 the number of annually diagnosed leukaemia (inci...
Maria Fazekas
RTS
2008
131views more  RTS 2008»
13 years 10 months ago
Formal verification of multitasking applications based on timed automata model
The aim of this paper is to show, how a multitasking application running under a real-time operating system compliant with an OSEK/VDX standard can be modeled by timed automata. Th...
Libor Waszniowski, Zdenek Hanzálek