976 search results - page 92 / 196 » The Complexity of Timetable Construction Problems |
TACAS
2009
Springer
14 years 3 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
AAAI
1996
13 years 10 months ago
1996
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...
ICTAI
2010
IEEE
13 years 7 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
SARA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...