757 search results - page 35 / 152 » On the hardness of approximating Max-Satisfy |
113
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
131
Voted
KDD
2008
ACM
16 years 2 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
124
click to vote
PODS
2008
ACM
16 years 2 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
133
Voted
WISE
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
135
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...