Sciweavers

1539 search results - page 39 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
101
Voted
HIS
2007
15 years 3 months ago
Exploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search
This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate efficien...
Crina Grosan, Ajith Abraham
86
Voted
ISCAS
2006
IEEE
79views Hardware» more  ISCAS 2006»
15 years 8 months ago
A low-power 64-point FFT/IFFT design for IEEE 802.11a WLAN application
—In this paper, we propose a cost-effective and low-power 64-point fast Fourier transform (FFT)/inverse FFT (IFFT) architecture and chip adopting the retrenched 8-point FFT/IFFT ...
Chin-Teng Lin, Yuan-Chu Yu, Lan-Da Van
PE
2008
Springer
109views Optimization» more  PE 2008»
15 years 2 months ago
A conditional probability approach to M/G/1-like queues
Following up on a recently renewed interest in computational methods for M/G/1-type processes, this paper considers an M/G/1-like system in which the service time distribution is ...
Alexandre Brandwajn, Hongyun Wang
INFOCOM
2006
IEEE
15 years 8 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely
126
Voted
JSCIC
2010
231views more  JSCIC 2010»
14 years 9 months ago
Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction
Variational models for image segmentation have many applications, but can be slow to compute. Recently, globally convex segmentation models have been introduced which are very rel...
Tom Goldstein, Xavier Bresson, Stanley Osher