976 search results - page 38 / 196 » The Complexity of Timetable Construction Problems |
104
click to vote
IMC
2003
ACM
15 years 3 months ago
2003
ACM
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimate of the network distance between ...
ACL
2006
14 years 11 months ago
2006
In this paper we report our work on building a POS tagger for a morphologically rich language- Hindi. The theme of the research is to vindicate the stand that- if morphology is st...
IJCAI
2003
14 years 11 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
107
click to vote
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...