578 search results - page 48 / 116 » The Minimum-Entropy Set Cover Problem |
145
Voted
WG
2004
Springer
15 years 10 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
138
click to vote
ICRA
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
135
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
146
click to vote
ATMOS
2007
15 years 6 months ago
2007
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...
142
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...