976 search results - page 54 / 196 » The Complexity of Timetable Construction Problems |
IRI
2006
IEEE
14 years 3 months ago
2006
IEEE
The development of solutions to complex problems requires finding answers to several questions which are obstacles on the road leading to the solution. To perpetuate progress, the...
MFCS
1989
Springer
14 years 1 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
PODS
2005
ACM
14 years 9 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
IEEEICCI
2007
IEEE
14 years 3 months ago
2007
IEEE
Granular computing concerns human thinking and problem solving, as well as their implications to the design of knowledge intensive systems. It simplifies complex real world probl...