Results 1  10
of
798,779
Worstcase 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
Towards Explaining the Speed of kMeans
"... The kmeans method is a popular algorithm for clustering, known for its speed in practice. This stands in contrast to its exponential worstcase runningtime. To explain the speed of the kmeans method, a smoothed analysis has been conducted. We sketch this smoothed analysis and a generalization to ..."
Abstract
 Add to MetaCart
The kmeans method is a popular algorithm for clustering, known for its speed in practice. This stands in contrast to its exponential worstcase runningtime. To explain the speed of the kmeans method, a smoothed analysis has been conducted. We sketch this smoothed analysis and a generalization
Efficient Parsing with the ProductFree Lambek Calculus
"... This paper provides a parsing algorithm for the Lambek calculus which is polynomial time for a more general fragment of the Lambek calculus than any previously known algorithm. The algorithm runs in worstcase time O(n5) when restricted to a certain fragment of the Lambek calculus which is motivated ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
is motivated by empirical analysis. In addition, a set of parameterized inputs are given, showing why the algorithm has exponential worstcase running time for the Lambek calculus in general. 1
Q : Worstcase Fair Weighted Fair Queueing
"... The Generalized Processor Sharing (GPS) discipline is proven to have two desirable properties: (a) it can provide an endtoend boundeddelay 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...
Worstcase and smoothed analysis of kmeans clustering with Bregman divergences
 In Proc. of the 20th Int. Symp. on Algorithms and Computation (ISAAC), volume 5878 of Lecture Notes in Computer Science
, 2009
"... The kmeans algorithm is the method of choice for clustering largescale data sets and it performs exceedingly well in practice despite its exponential worstcase runningtime. To narrow the gap between theory and practice, kmeans has been studied in the semirandom input model of smoothed analysis ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
The kmeans algorithm is the method of choice for clustering largescale data sets and it performs exceedingly well in practice despite its exponential worstcase runningtime. To narrow the gap between theory and practice, kmeans has been studied in the semirandom input model of smoothed
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
of probability distributions — are best studied in the general setting. Working with exponential family representations, and exploiting the conjugate duality between the cumulant function and the entropy for exponential families, we develop general variational representations of the problems of computing
WorstCase Optimal and AverageCase Efficient Geometric AdHoc Routing
, 2003
"... In this paper we present GOAFR, a new geometric adhoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first adhoc algorithm to be both asymptotically optimal and averagecase e#cient. For our simul ..."
Abstract

Cited by 245 (11 self)
 Add to MetaCart
In this paper we present GOAFR, a new geometric adhoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first adhoc algorithm to be both asymptotically optimal and averagecase e#cient. For our
WorstCase Running Times for AverageCase Algorithms
"... Abstract—Under a standard hardness assumption we exactly characterize the worstcase running time of languages that are in average polynomialtime over all polynomialtime samplable distributions. More precisely we show that if exponential time is not infinitely often in subexponential space, then t ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract—Under a standard hardness assumption we exactly characterize the worstcase running time of languages that are in average polynomialtime over all polynomialtime samplable distributions. More precisely we show that if exponential time is not infinitely often in subexponential space
Information Processing Letters The worstcase
, 1995
"... running time of the random simplex algorithm is exponential in the height ..."
Abstract
 Add to MetaCart
running time of the random simplex algorithm is exponential in the height
A WorstCase Worm
, 2004
"... Worms represent a substantial economic threat to the U.S. computing infrastructure. An important question is how much damage might be caused, as this figure can serve as a guide to evaluating how much to spend on defenses. We construct a parameterized worstcase analysis based on a simple damage mod ..."
Abstract

Cited by 35 (1 self)
 Add to MetaCart
Worms represent a substantial economic threat to the U.S. computing infrastructure. An important question is how much damage might be caused, as this figure can serve as a guide to evaluating how much to spend on defenses. We construct a parameterized worstcase analysis based on a simple damage
Results 1  10
of
798,779