4218 search results - page 48 / 844 » Complete sets of cooperations |
SIAMMAX
2010
13 years 2 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—Cooperative relaying has been shown to provide diversity gains which can significantly improve the Packet Error Rate (PER) in wireless transmissions. In ad hoc wireless routing...
GECCO
2009
Springer
14 years 8 days ago
2009
Springer
High–dimensional optimization problems appear very often in demanding applications. Although evolutionary algorithms constitute a valuable tool for solving such problems, their ...
EUSFLAT
2007
13 years 9 months ago
2007
Cooperative games under precedence constraints have been introduced by Faigle and Kern [1] , [4] as a generalization of classical cooperative games. An important notion in coopera...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...