2485 search results - page 153 / 497 » Time Bounded Frequency Computations |
154
click to vote
SIAMSC
2008
15 years 5 months ago
2008
Abstract. The sequential regularization method is a reformulation of the unsteady Navier-Stokes equations from the view point of constrained dynamical systems or approximate Helmho...
141
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
155
Voted
CONCUR
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
130
Voted
STOC
2003
ACM
16 years 5 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
129
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...