Results 1  10
of
1,016,529
A Better Upper Bound for the Unsatisfiability Threshold
 DIMACS Series in Discrete Mathematics and Theoretical Computer Science
, 1996
"... . Let OE be a random Boolean formula that is an instance of 3SAT. We consider the problem of computing the least real number such that if the ratio of the number of clauses over the number of variables of OE strictly exceeds , then OE is almost certainly unsatisfiable. By a well known and more or ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
that this upper bound can be improved to 4.667. Our proof is elementary and short, and does not use unverifiable mechanical calculations. Moreover it generalizes in a straightforward manner to kSAT, for k ? 3. 1. Introduction Let OE be a random 3SAT formula on n Boolean variables x 1 ; : : : ; xn . Let m
A Threshold of ln n for Approximating Set Cover
 JOURNAL OF THE ACM
, 1998
"... Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhar ..."
Abstract

Cited by 778 (5 self)
 Add to MetaCart
hard. We prove that (1 \Gamma o(1)) ln n is a threshold below which set cover cannot be approximated efficiently, unless NP has slightly superpolynomial time algorithms. This closes the gap (up to low order terms) between the ratio of approximation achievable by the greedy algorithm (which is (1 \Gamma
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
, 2008
"... ..."
A Limited Memory Algorithm for Bound Constrained Optimization
 SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract

Cited by 557 (9 self)
 Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
Plans And ResourceBounded Practical Reasoning
 COMPUTATIONAL INTELLIGENCE, 4(4):349355, 1988
, 1988
"... An architecture for a rational agent must allow for meansend reasoning, for the weighing of competing alternatives, and for interactions between these two forms of reasoning. Such an architecture must also address the problem of resource boundedness. We sketch a solution of the first problem that p ..."
Abstract

Cited by 485 (19 self)
 Add to MetaCart
that points the way to a solution of the second. In particular, we present a highlevel specification of the practicalreasoning component of an architecture for a resourcebounded rational agent. In this architecture, a major role of the agent's plans is to constrain the amount of further practical
Boosting a Weak Learning Algorithm By Majority
, 1995
"... We present an algorithm for improving the accuracy of algorithms for learning binary concepts. The improvement is achieved by combining a large number of hypotheses, each of which is generated by training the given learning algorithm on a different set of examples. Our algorithm is based on ideas pr ..."
Abstract

Cited by 516 (15 self)
 Add to MetaCart
upper bounds known today. We show that the number of hypotheses that are combined by our algorithm is the smallest number possible. Other outcomes of our analysis are results regarding the representational power of threshold circuits, the relation between learnability and compression, and a method
Approximating the unsatisfiability threshold of random formulas
, 1998
"... ABSTRACT: Let � be a random Boolean formula that is an instance of 3SAT. We consider the problem of computing the least real number � such that if the ratio of the number of clauses over the number of variables of � strictly exceeds �, then � is almost certainly unsatisfiable. By a wellknown and m ..."
Abstract

Cited by 88 (15 self)
 Add to MetaCart
ABSTRACT: Let � be a random Boolean formula that is an instance of 3SAT. We consider the problem of computing the least real number � such that if the ratio of the number of clauses over the number of variables of � strictly exceeds �, then � is almost certainly unsatisfiable. By a well
Using information content to evaluate semantic similarity in a taxonomy
 In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI95
, 1995
"... philip.resnikfleast.sun.com This paper presents a new measure of semantic similarity in an ISA taxonomy, based on the notion of information content. Experimental evaluation suggests that the measure performs encouragingly well (a correlation of r = 0.79 with a benchmark set of human similarity judg ..."
Abstract

Cited by 1072 (8 self)
 Add to MetaCart
judgments, with an upper bound of r = 0.90 for human subjects performing the same task), and significantly better than the traditional edge counting approach (r = 0.66). 1
A Scheme for RealTime Channel Establishment in WideArea Networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1990
"... Multimedia communication involving digital audio and/or digital video has rather strict delay requirements. A realtime channel is defined in this paper as a simplex connection between a source and a destination characterized by parameters representing the performance requirements of the client. A r ..."
Abstract

Cited by 710 (31 self)
 Add to MetaCart
realtime service is capable of creating realtime channels on demand and guaranteeing their performance. These guarantees often take the form of lower bounds on the bandwidth allocated to a channel and upper bounds on the delays to be experienced by a packet on the channel. In this paper
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
Results 1  10
of
1,016,529