# Max

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2008

Highly Cited

2008

- J. Artif. Intell. Res.
- 2008

In this paper we introduce MINI MAX SAT, a new Max-SAT solver that is built on top of M INISAT+. It incorporates the best currentâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- SAT
- 2006

Boolean Satisfiability (SAT) has seen many successful applications in various fields such as Electronic Design Automation andâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- STOC
- 2005

A randomness extractor is an algorithm which extracts randomness from a low-quality random source, using some additional trulyâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Ant Algorithms
- 2002

We consider a simplification of a typical university course timetabling problem involving three types of hard and three types ofâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- IJCAI
- 2001

R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomialâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Future Generation Comp. Syst.
- 2000

Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking hard combinatorialâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- IPCO
- 1995

Polynomial-time approximation algorithms with non-trivial performance guarantees are presented for the problems of (aâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- ISTCS
- 1995

It is well known that two prover proof systems are a convenient tool for establishing hardness of approximation results. In thisâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- STOC
- 1994

We present randomized approximation algorithms for the MAX CUT and MAX 2SAT problems that always deliver solutions of expectedâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Inf. Process. Lett.
- 1991

We prove that maximum three dimensional matching is a MAX SNP-hard problem. If the number of occurrences of elements in triplesâ€¦Â (More)

Is this relevant?