1272 search results - page 139 / 255 » The Set Cover with Pairs Problem |
PVLDB
2010
13 years 5 months ago
2010
Given a set of users, their friend relationships, and a distance threshold per friend pair, the proximity detection problem is to find each pair of friends such that the Euclidean...
APPROX
2008
Springer
14 years 23 days ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
BIOINFORMATICS
2007
13 years 11 months ago
2007
Primer approximation multiplex PCR (PAMP) is a new experimental protocol for efficiently assaying structural variation in genomes. PAMP is particularly suited to cancer genomes w...
APPROX
2005
Springer
14 years 4 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
ATAL
2008
Springer
14 years 23 days ago
2008
Springer
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...