Skip to search formSkip to main contentSkip to account menu

DTIME

Known as: DTIME(f(n)), Deterministic time, TIME(f(n)) 
In computational complexity theory, DTIME (or TIME) is the computational resource of computation time for a deterministic Turing machine. It… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
The fusion of measurements from star trackers and gyroscopes within optimal estimators/filters is a common approach for… 
Review
2009
Review
2009
This paper provides a fully decentralized algorithm that aims at creating a robust backbone in Mobile Ad hoc Networks (MANETs… 
2007
2007
A CDMA-based mobile Ad Hoc networks face two main design challenges. One is to periodically update connectivit y information… 
2006
2006
Feature Issue on ConvergenceWe present a load-balanced packet router with an all-optical data plane and a decentralized control… 
2004
2004
This paper explores the simulation problem on train energy-efficient operation with fixed running time. A simulation system has… 
2000
2000
It is often assumed that interference or noise signals are Gaussian stochastic processes. Gaussian noise models are appealing as… 
1996
1996
A fundamental postulate of quantum mechanics states that a measurement of a quantum system causes the collapse of the wave… 
1988
1988
The authors report on time-varying delay estimation in a multisource single direct acoustic path environment. The signals are… 
1979
1979
Simulation is used to evaluate a number of server assignment prodecures within a system of parallel queues. There are less…