Results 1  10
of
1,766
Coalition Structure Generation with Worst Case Guarantees
, 1999
"... Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. Furthermore, finding the optimal coalition ..."
Abstract

Cited by 270 (9 self)
 Add to MetaCart
structure is NPcomplete. But then, can the coalition structure found via a partial search be guaranteed to be within a bound from optimum? We show that none of the previous coalition structure generation algorithms can establish any bound because they search fewer nodes than a threshold that we show
Online Checkpointing with Improved WorstCase Guarantees
"... Abstract. In the online checkpointing problem, the task is to continuously maintain a set of k checkpoints that allow to rewind an ongoing computation faster than by a full restart. The only operation allowed is to remove an old checkpoint and to store the current state instead. Our aim are checkpoi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. In the online checkpointing problem, the task is to continuously maintain a set of k checkpoints that allow to rewind an ongoing computation faster than by a full restart. The only operation allowed is to remove an old checkpoint and to store the current state instead. Our aim are checkpoint placement strategies that minimize rewinding cost, i.e., such that at all times T when requested to rewind to some time t ≤ T the number of computation steps that need to be redone to get to t from a checkpoint before t is as small as possible. In particular, we want that the closest checkpoint earlier than t is not further away from t than pk times the ideal distance T/(k + 1), where pk is a small constant. Improving over earlier work showing 1 + 1/k ≤ pk ≤ 2, we show that pk can be chosen less than 2 uniformly for all k. More precisely, we show the uniform bound pk ≤ 1.7 for all k, and present algorithms with asymptotic performance pk ≤ 1.59 + o(1) valid for all k and pk ≤ ln(4) + o(1) ≤ 1.39+o(1) valid for k being a power of two. For small values of k, we show how to use a linear programming approach to compute good checkpointing algorithms. This gives performances of less than 1.53 for k ≤ 10. One the more theoretical side, we show the first lower bound that is asymptotically more than one, namely pk ≥ 1.30 − o(1). We also show that optimal algorithms (yielding the infimum performance) exist for all k. 1
Probabilistic Planning with NonLinear Utility Functions and WorstCase Guarantees ∗
"... Markov Decision Processes are one of the most widely used frameworks to formulate probabilistic planning problems. Since planners are often risksensitive in highstake situations, nonlinear utility functions are often introduced to describe their preferences among all possible outcomes. Alternativ ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. Alternatively, risksensitive decision makers often require their plans to satisfy certain worstcase guarantees. We show how to combine these two approaches by considering problems where we maximize the expected utility of the total reward subject to worstcase constraints. We generalize several existing
Minimum search to establish worstcase guarantees in coalition structure generation
 In IJCAI’11: Twenty Second International Joint Conference on Artificial Intelligence
, 2011
"... Coalition formation is a fundamental research topic in multiagent systems. In this context, while it is desirable to generate a coalition structure that maximizes the sum of the values of the coalitions, the space of possible solutions is often too large to allow exhaustive search. Thus, a fundamen ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
fundamental open question in this area is the following: Can we search through only a subset of coalition structures, and be guaranteed to find a solution that is within a desirable bound β from optimum? If so, what is the minimum such subset? To date, the above question has only been partially answered
Coalition structure generation with worst case guarantees based on cardinality structure
 Proceedings of the 6th international
, 2007
"... ..."
Proceedings of the TwentySecond International Joint Conference on Artificial Intelligence Minimum Search To Establish WorstCase Guarantees in Coalition Structure Generation
"... Coalition formation is a fundamental research topic in multiagent systems. In this context, while it is desirable to generate a coalition structure that maximizes the sum of the values of the coalitions, the space of possible solutions is often too large to allow exhaustive search. Thus, a fundamen ..."
Abstract
 Add to MetaCart
fundamental open question in this area is the following: Can we search through only a subset of coalition structures, and be guaranteed to find a solution that is within a desirable bound β from optimum? If so, what is the minimum such subset? To date, the above question has only been partially answered
Modified GaussNewton
"... scheme with worstcase guarantees for its global performance Yu. Nesterov∗ ..."
Abstract
 Add to MetaCart
scheme with worstcase guarantees for its global performance Yu. Nesterov∗
On Clusterings: Good, Bad and Spectral
, 2003
"... We motivate and develop a natural bicriteria measure for assessing the quality of a clustering which avoids the drawbacks of existing measures. A simple recursive heuristic is shown to have polylogarithmic worstcase guarantees under the new measure. The main result of the paper is the analysis of ..."
Abstract

Cited by 332 (11 self)
 Add to MetaCart
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering which avoids the drawbacks of existing measures. A simple recursive heuristic is shown to have polylogarithmic worstcase guarantees under the new measure. The main result of the paper is the analysis
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 365 (11 self)
 Add to MetaCart
of whether or not their traffic is constrained. The former property is the basis for supporting guaranteed service traffic while the later property is important for supporting besteffort service traffic. Since GPS uses an idealized fluid model which cannot be realized in the real world, various packet
Beyond Worstcase Analysis for Joins with Minesweeper
, 2014
"... We describe a new algorithm, Minesweeper, that is able to satisfy stronger runtime guarantees than previous join algorithms (colloquially, ‘beyond worstcase guarantees’) for data in indexed search trees. Our first contribution is developing a framework to measure this stronger notion of complexity, ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We describe a new algorithm, Minesweeper, that is able to satisfy stronger runtime guarantees than previous join algorithms (colloquially, ‘beyond worstcase guarantees’) for data in indexed search trees. Our first contribution is developing a framework to measure this stronger notion of complexity
Results 1  10
of
1,766