2181 search results - page 71 / 437 » The restriction scaffold problem |
AAAI
2000
13 years 10 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
SAGT
2010
Springer
13 years 7 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
EDM
2009
13 years 6 months ago
2009
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
SIAMCOMP
2011
13 years 3 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
LICS
2012
IEEE
11 years 11 months ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...