5169 search results - page 123 / 1034 » Locality approximation using time |
111
click to vote
MOC
1998
15 years 6 months ago
1998
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect ...
251
click to vote
PE
2008
Springer
15 years 5 months ago
2008
Springer
We consider single-server and multi-server queues with deterministic reneging times motivated by the timeout mechanisms used in application servers.. A Volterra integral equation ...
166
click to vote
BC
1998
15 years 6 months ago
1998
Complexity measures of non-linear dynamics are a useful tool for quantifying observed stretching, folding, scaling and mixing processes in the Takens-reconstructed state space of h...
176
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
200
click to vote
CONCUR
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...