2040 search results - page 132 / 408 » On the Complexity of Error Explanation |
STACS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
ANSS
2002
IEEE
14 years 2 months ago
2002
IEEE
Cell-DEVS is an extension to the DEVS formalism that allows the definition of cellular models. Complex physical systems can be defined using simple rules, reducing the development...
ANSS
2000
IEEE
14 years 1 months ago
2000
IEEE
A specification language was defined to outline sections of cities as cell spaces. The goal is to allow the definition of complex traffic models in a simple fashion for the modele...
LATIN
1998
Springer
14 years 1 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
SIAMJO
2008
13 years 9 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...