4131 search results - page 61 / 827 » The Generalized Max-Controlled Set Problem |
147
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— The main task in OFDM downlink scheduling design is to maximize some kind of utility considering user specific as well as system induced constraints. A typical example is the ...
102
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
62
Voted
CORR
2010
Springer
15 years 10 days ago
2010
Springer
An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in th...
145
click to vote
TCS
2010
15 years 1 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
126
click to vote
TCS
1998
15 years 2 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...