Results 1  10
of
46,259
Worstcase Time Bounds for Coloring and Satisfiability Problems
, 2002
"... We consider worst case time bounds for NPcomplete problems. For the (k, 2)satisfiability problem, we give a randomized algorithm that runs in time O\Lambda ((k!)n=k). This bound is O((k=ck)n) with ck increasing to the asymptotic limit e, and improves for k * 11 over the O((0:4518k)n) randomized b ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
We consider worst case time bounds for NPcomplete problems. For the (k, 2)satisfiability problem, we give a randomized algorithm that runs in time O\Lambda ((k!)n=k). This bound is O((k=ck)n) with ck increasing to the asymptotic limit e, and improves for k * 11 over the O((0:4518k)n) randomized
Orienting Fully Dynamic Graphs with WorstCase Time Bounds
, 2014
"... In edge orientations, the goal is usually to orient (direct) the edges of an undirected network (modeled by a graph) such that all outdegrees are bounded. When the network is fully dynamic, i.e., admits edge insertions and deletions, we wish to maintain such an orientation while keeping a tab on th ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
degree and a logarithmic amortized update time for all graphs with constant arboricity, which include all planar and excludedminor graphs. It remained an open question – first proposed by Brodal and Fagerberg, later by Erickson and others – to obtain similar bounds with worstcase update time. We address
Worstcase time bounds for MAXkSAT w.r.t. the number of variables using local search
, 2000
"... During the past three years there was an explosion of algorithms solving MAXSAT and MAX2SAT in worstcase time of the order c K , where c < 2 is a constant, and K is the number of clauses in the input formula. Such bounds w.r.t. the number of variables instead of the number of clauses are not ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
During the past three years there was an explosion of algorithms solving MAXSAT and MAX2SAT in worstcase time of the order c K , where c < 2 is a constant, and K is the number of clauses in the input formula. Such bounds w.r.t. the number of variables instead of the number of clauses
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 847 (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
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
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
Bounding worstcase instruction cache performance
 In IEEE RealTime Systems Symposium
, 1994
"... The use of caches poses a difficult tradeoff for architects of realtime systems. While caches provide significant performance advantages, they have also been viewed as inherently unpredictable since the behavior of a cache reference depends upon the history of the previous references. The use of ca ..."
Abstract

Cited by 131 (38 self)
 Add to MetaCart
Simulation is used to analyze a program’s control flow to statically categorize the caching behavior of each instruction. A timing analyzer, which uses the categorization information, then estimates the worstcase instruction cache performance for each loop and function in the program. 1.
Expected Time Bounds for Selection
, 1975
"... A new selection algorithm is presented which is shown to be very efficient on the average, both theoretically and practically. The number of comparisons used to select the ith smallest of n numbers is n q min(i,ni) q o(n). A lower bound within 9 percent of the above formula is also derived. ..."
Abstract

Cited by 459 (4 self)
 Add to MetaCart
A new selection algorithm is presented which is shown to be very efficient on the average, both theoretically and practically. The number of comparisons used to select the ith smallest of n numbers is n q min(i,ni) q o(n). A lower bound within 9 percent of the above formula is also derived.
Reasoning the fast and frugal way: Models of bounded rationality.
 Psychological Review,
, 1996
"... Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors have ..."
Abstract

Cited by 611 (30 self)
 Add to MetaCart
Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors
A LinearTime Heuristic for Improving Network Partitions
, 1982
"... An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning. To d ..."
Abstract

Cited by 524 (0 self)
 Add to MetaCart
An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning
Results 1  10
of
46,259