Max

Known as: Max/Msp, Patcher, MaxMSP 
Max is a visual programming language for music and multimedia developed and maintained by San Francisco-based software company Cycling '74. During… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Boolean Satisfiability (SAT) has seen many successful applications in various fields such as Electronic Design Automation and… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2005
Highly Cited
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
We consider a simplification of a typical university course timetabling problem involving three types of hard and three types of… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2001
Highly Cited
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
Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking hard combinatorial… (More)
  • figure 2
  • table 1
  • table 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
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
It is well known that two prover proof systems are a convenient tool for establishing hardness of approximation results. In this… (More)
  • table 1
Is this relevant?
Highly Cited
1994
Highly Cited
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
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?