3475 search results - page 177 / 695 » Backbones in Optimization and Approximation |
185
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
187
click to vote
SADM
2008
15 years 5 months ago
2008
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
183
click to vote
TON
2010
15 years 4 months ago
2010
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
170
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we study stochastic dynamic games with many players that are relevant for a wide range of social, economic, and engineering applications. The standard solution conce...
145
click to vote
ISSAC
2007
Springer
16 years 17 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...