1125 search results - page 133 / 225 » On the job rotation problem |
103
Voted
ACL
2011
14 years 4 months ago
2011
Compositional question answering begins by mapping questions to logical forms, but training a semantic parser to perform this mapping typically requires the costly annotation of t...
115
Voted
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
CP
2007
Springer
15 years 7 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
117
Voted
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
101
Voted
IJCAI
1989
15 years 2 months ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...