Parameterized Complexity of Generalized Domination Problems on Bounded Tree-Width Graphs