Sciweavers

1272 search results - page 139 / 255
» The Set Cover with Pairs Problem
Sort
View
PVLDB
2010
100views more  PVLDB 2010»
13 years 5 months ago
Efficient Proximity Detection among Mobile Users via Self-Tuning Policies
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...
Man Lung Yiu, Leong Hou U, Simonas Saltenis, Kosta...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
14 years 23 days ago
Approximating Optimal Binary Decision Trees
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, . ....
Micah Adler, Brent Heeringa
BIOINFORMATICS
2007
76views more  BIOINFORMATICS 2007»
13 years 11 months ago
Optimization of primer design for the detection of variable genomic lesions in cancer
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...
Ali Bashir, Yu-Tsueng Liu, Benjamin J. Raphael, De...
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
14 years 4 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
ATAL
2008
Springer
14 years 23 days ago
Coalitional skill games
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...
Yoram Bachrach, Jeffrey S. Rosenschein