1927 search results - page 133 / 386 » UMDAs for dynamic optimization problems |
108
click to vote
MMB
1999
Springer
15 years 5 months ago
1999
Springer
The rapidly increasing traffic demand from mobile users forces network operators and service providers to extend and optimize existing networks as well as to plan entirely new mo...
110
Voted
IDMS
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...
122
click to vote
KDD
2007
ACM
16 years 1 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
132
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
103
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
One of the hard problems in automated sign language recognition is the movement epenthesis (me) problem. Movement epenthesis is the gesture movement that bridges two consecutive s...