3874 search results - page 186 / 775 » Approximation Algorithms for k-hurdle Problems |
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Finding the least squares (LS) solution s to a system of linear equations Hs = y where H, y are given and s is a vector of binary variables, is a well known NP-hard problem. In th...
129
Voted
ISAAC
2003
Springer
15 years 7 months ago
2003
Springer
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
115
click to vote
COLT
2004
Springer
15 years 5 months ago
2004
Springer
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
168
click to vote
DAM
2011
14 years 9 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
109
click to vote
DIALM
2008
ACM
15 years 3 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...