Sciweavers

2354 search results - page 208 / 471
» A Common-Sense Theory of Time
Sort
View
CP
2009
Springer
16 years 7 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 7 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
ICFP
2006
ACM
16 years 6 months ago
Boxy types: inference for higher-rank types and impredicativity
Languages with rich type systems are beginning to employ a blend of type inference and type checking, so that the type inference engine is guided by programmer-supplied type annot...
Dimitrios Vytiniotis, Stephanie Weirich, Simon L. ...
DCC
2008
IEEE
16 years 6 months ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
16 years 4 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor