1272 search results - page 67 / 255 » The Set Cover with Pairs Problem |
125
Voted
NIPS
1998
15 years 5 months ago
1998
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
134
Voted
WG
2004
Springer
15 years 9 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...
121
click to vote
ICRA
2008
IEEE
15 years 10 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)...
116
Voted
APPROX
2004
Springer
15 years 9 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...
135
Voted
ATMOS
2007
15 years 5 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...