976 search results - page 91 / 196 » The Complexity of Timetable Construction Problems |
CAISE
2004
Springer
14 years 2 months ago
2004
Springer
In architecture companies, work is very often performed by several individuals. From conceptual design to the construction of a final product, the object passes through many hands,...
SEFM
2003
IEEE
14 years 2 months ago
2003
IEEE
Despite the advances in software engineering since 1968, current methods for going from a set of functional requirements to a design are not as direct, repeatable and constructive...
JAIR
2007
13 years 9 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
FIW
2009
13 years 6 months ago
2009
One of the most difficult tasks in software development is that features are implemented by changing the code of other features. This problem cannot be solved with existing general...
FOCS
1995
IEEE
14 years 17 days ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...