16404 search results - page 162 / 3281 » A set coverage problem |
196
click to vote
ICC
2007
IEEE
16 years 20 days 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 ...
147
click to vote
COMPGEOM
2004
ACM
15 years 11 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...
162
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
172
click to vote
ISBI
2004
IEEE
16 years 7 months ago
2004
IEEE
SCIRun is a general purpose problem solving environment that seeks to integrate the steps of preparing, executing, and visualizing simulations of physical and biological systems. ...
194
click to vote
ANTS
2006
Springer
15 years 10 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...