5981 search results - page 226 / 1197 » time 2006 |
186
click to vote
JDA
2006
15 years 6 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
168
click to vote
IPL
2002
15 years 6 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
179
click to vote
INFORMATICALT
1998
15 years 6 months ago
1998
Principles of the framework called time series forecasting automation are presented. It is required in processing massive temporal data sets and creating completely user-oriented f...
190
click to vote
JOLLI
2002
15 years 6 months ago
2002
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x...
158
click to vote
MOR
2010
15 years 4 months ago
2010
We study G/G/n + GI queues in which customer patience times are independent, identically distributed following a general distribution. When a customer’s waiting time in queue ex...