837 search results - page 16 / 168 » Hard combinators |
93
Voted
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
TSP
2010
14 years 4 months ago
2010
A random beamforming scheme for the Gaussian MIMO broadcast channel with channel quality feedback is investigated and extended. Considering the case where the receivers each have r...
AMAI
2005
Springer
14 years 10 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
ICSE
2009
IEEE-ACM
15 years 4 months ago
2009
IEEE-ACM
Determining whether a set of features can be composed, or safe composition, is a hard problem in software product line engineering because the number of feature combinations can b...
IJCV
2000
14 years 10 months ago
2000
Optical flow provides a constraint on the motion of a deformable model. We derive and solve a dynamic system incorporating flow as a hard constraint, producing a model-based least...