Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

42

SCW
2012
IEEE

favoriteEmaildiscussreport

299views Applied Computing» more SCW 2012»

The minimal covering set in large tournaments

12 years 6 months ago

The minimal covering set in large tournaments

Download people.maths.ox.ac.uk

Alex Scott, Mark Fey

Real-time Traffic

Applied Computing | SCW 2012 |

claim paper

Related Content

» Computing the minimal covering set

» A Computational Analysis of the Tournament Equilibrium Set

» On covering by translates of a set

» Generating an informative cover for association rules

» Minimizing embedding impact in steganography using trelliscoded quantization

» Two Stage View Planning for LargeScale Site Modeling

» Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints

» BOOM A Heuristic Boolean Minimizer

» Modeling Rule Precision

Post Info
More Details (n/a)

Added	25 Apr 2012
Updated	25 Apr 2012
Type	Journal
Year	2012
Where	SCW
Authors	Alex Scott, Mark Fey

Comments (0)