976 search results - page 67 / 196 » The Complexity of Timetable Construction Problems |
IJCM
2010
13 years 7 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
TIT
2010
13 years 3 months ago
2010
In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multigroup maximum-likelihood (ML) decoding are studied. First, the collocated case is conside...
ICPP
1992
IEEE
14 years 1 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
CEC
2008
IEEE
14 years 3 months ago
2008
IEEE
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
KR
1989
Springer
14 years 1 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...