Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,805,196
EXPOSE: Inferring Worst-case Time Complexity by Automatic Empirical Study
"... Introduction to doubling. A useful understanding of an algorithm’s efficiency, the worst-case time complexity gives an upper bound on how an increase in the size of the input, denoted n, increases the execution time of the algo-rithm, or f(n). This relationship is often expressed in the ..."
Abstract
- Add to MetaCart
Introduction to doubling. A useful understanding of an algorithm’s efficiency, the worst-case time complexity gives an upper bound on how an increase in the size of the input, denoted n, increases the execution time of the algo-rithm, or f(n). This relationship is often expressed in the
Worst-case time complexity of a lattice formation problem
"... Abstract — We consider a formation control problem for a robotic network with limited communication and controlled motion abilities. We propose a novel control structure that organizes the robots in concentric layers and that associates to each layer a local leader. Through a load balancing algorith ..."
Abstract
- Add to MetaCart
algorithm on the asynchronous network of layers we allocate the desired number of robots on each layer. A final uniform spreading algorithm leads the robots to a lattice-like formation. This novel distributed communication and control algorithm runs in linear time in the worst case. I.
Worst-case equilibria
- IN PROCEEDINGS OF THE 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
, 1999
"... In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a ver ..."
Abstract
-
Cited by 851 (17 self)
- Add to MetaCart
In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a
A discrete subexponential algorithm for parity games
- STACS’03
, 2003
"... We suggest a new randomized algorithm for solving parity games with worst case time complexity roughly ..."
Abstract
-
Cited by 37 (8 self)
- Add to MetaCart
We suggest a new randomized algorithm for solving parity games with worst case time complexity roughly
Q : Worst-case Fair Weighted Fair Queueing
"... The Generalized Processor Sharing (GPS) discipline is proven to have two desirable properties: (a) it can provide an end-to-end bounded-delay service to a session whose traffic is constrained by a leaky bucket; (b) it can ensure fair allocation of bandwidth among all backlogged sessions regardless o ..."
Abstract
-
Cited by 361 (11 self)
- Add to MetaCart
transmission time of that provided by GPS. In this paper, we will show that, contrary to pop...
Complexity of finding embeddings in a k-tree
- SIAM JOURNAL OF DISCRETE MATHEMATICS
, 1987
"... A k-tree is a graph that can be reduced to the k-complete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a k-tree. This problem is motivated by the existence of polynomial time al ..."
Abstract
-
Cited by 390 (1 self)
- Add to MetaCart
status of two problems related to finding the smallest number k such that a given graph is a partial k-tree. First, the corresponding decision problem is NP-complete. Second, for a fixed (predetermined) value of k, we present an algorithm with polynomially bounded (but exponential in k) worst case time
Arbitrary-Precision Division
"... This paper presents an algorithm for arbitrary-precision division and shows its worst-case time complexity to be related by a constant factor to that of arbitrary-precision multiplication. The material is adapted from [1], pp. 264, 295-297, where S. A. Cook is credited for suggesting the basic idea. ..."
Abstract
- Add to MetaCart
This paper presents an algorithm for arbitrary-precision division and shows its worst-case time complexity to be related by a constant factor to that of arbitrary-precision multiplication. The material is adapted from [1], pp. 264, 295-297, where S. A. Cook is credited for suggesting the basic idea
© 1996 Springer-Verlag New York Inc. A Mildly Exponential Approximation Algorithm for the Permanent
"... Abstract. A new approximation algorithm for the permanent of an n × n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n 1/2 log 2 n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time compl ..."
Abstract
- Add to MetaCart
Abstract. A new approximation algorithm for the permanent of an n × n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n 1/2 log 2 n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time
Results 1 - 10
of
3,805,196
