2694 search results - page 102 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
109
Voted
ICCSA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
162
Voted
TON
2010
14 years 9 months ago
2010
Abstract--We consider a scheduled orthogonal frequency division multiplexed (OFDM) wireless cellular network where the channels from the base-station to the mobile users undergo fl...
118
click to vote
NIPS
2008
15 years 4 months ago
2008
We formulate and study a new variant of the k-armed bandit problem, motivated by e-commerce applications. In our model, arms have (stochastic) lifetime after which they expire. In...
149
Voted
KDD
2012
ACM
13 years 5 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
158
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—Robustness of optimization models for networking problems has been an under-explored area. Yet most existing algorithms for solving robust optimization problems are centralized,...