18306 search results - page 18 / 3662 » Algorithmics in Exponential Time |
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Temporal data analysis in data warehouses and data streaming systems often uses time decay to reduce the importance of older tuples, without eliminating their influence, on the res...
ISNN
2005
Springer
14 years 1 months ago
2005
Springer
This paper considers the robust stability of neural networks with multiple delays. Based on Lyapunov stability theory and linear matrix inequality technique, some new delay indepe...
TNN
2008
13 years 6 months ago
2008
Abstract--In this paper, we consider delayed bidirectional associative memory (BAM) neural networks (NNs) with Lipschitz continuous activation functions. By applying Young's i...
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
MANSCI
2008
13 years 7 months ago
2008
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...