10901 search results - page 138 / 2181 » Approximations in Distributed Optimization |
179
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
167
click to vote
SIGMETRICS
2010
ACM
15 years 1 months ago
2010
ACM
Shortest Remaining Processing Time first (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such,...
188
click to vote
NIPS
2001
15 years 7 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
139
click to vote
MOC
2000
15 years 6 months ago
2000
In the approximation of linear elliptic operators in mixed form, it is well known that the so-called inf-sup and ellipticity in the kernel properties are sufficient (and, in a sens...
175
click to vote
FPL
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a hardware architecture for non-uniform random number generation, which allows the generator's distribution to be modified at run-time without reconfigura...