Sciweavers

1439 search results - page 97 / 288
» Fast approximation of centrality
Sort
View
ATAL
2010
Springer
14 years 11 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
MP
2002
176views more  MP 2002»
14 years 9 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
INFOCOM
2007
IEEE
15 years 4 months ago
An Accurate Link Model and Its Application to Stability Analysis of FAST TCP
— This paper presents a link model which captures the queue dynamics when congestion windows of TCP sources change. By considering both the self-clocking and the link integrator ...
Ao Tang, Krister Jacobsson, Lachlan L. H. Andrew, ...
ECRTS
2005
IEEE
15 years 3 months ago
Fast and Tight Response-Times for Tasks with Offsets
In previous work, we presented a tight approximate response-time analysis for tasks with offsets. While providing a tight bound on response times, the tight analysis exhibits simi...
Jukka Mäki-Turja, Mikael Nolin
APCCAS
2006
IEEE
261views Hardware» more  APCCAS 2006»
14 years 12 months ago
A Grouped Fast Fourier Transform Algorithm Design For Selective Transformed Outputs
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
Chih-Peng Fan, Guo-An Su