14165 search results - page 343 / 2833 » The generalized two-server problem |
172
click to vote
AAAI
2006
15 years 8 months ago
2006
We use game theory to analyze meta-learning algorithms. The objective of meta-learning is to determine which algorithm to apply on a given task. This is an instance of a more gene...
317
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
146
click to vote
SIAMJO
2010
15 years 1 months ago
2010
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
185
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
220
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...