Sciweavers

1458 search results - page 112 / 292
» Monads for incremental computing
Sort
View
ICC
2007
IEEE
111views Communications» more  ICC 2007»
15 years 9 months ago
Computationally Efficient Optimal Discrete Bit Allocation for Medium and High Target Bit Rate DMT Transmissions
—A computationally efficient optimal discrete bit allocation algorithm is proposed for medium and high target bit rate discrete multitone (DMT) transmissions. Unlike conventional...
Li-ping Zhu, Xiaofeng Zhong, Yan Yao, Shi-wei Dong...
IPPS
1997
IEEE
15 years 7 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
128
Voted
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 7 months ago
A computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies
First, the covariance matrix adaptation (CMA) with rankone update is introduced into the (1+1)-evolution strategy. An improved implementation of the 1/5-th success rule is propose...
Christian Igel, Thorsten Suttorp, Nikolaus Hansen
143
Voted
ASWEC
2007
IEEE
15 years 9 months ago
Dynamic Protocol Aggregation and Adaptation for Service-Oriented Computing
Service Oriented Computing (SOC) is a paradigm for building new software applications from existing loosely-coupled services. During service composition, services available to pla...
Linh Duy Pham, Alan W. Colman, Jean-Guy Schneider
HICSS
2007
IEEE
138views Biometrics» more  HICSS 2007»
15 years 9 months ago
A Probabilistic Graphical Approach to Computing Electricity Price Duration Curves under Price and Quantity Competition
Abstract— The electricity price duration curve (EPDC) represents the probability distribution function of the electricity price considered as a random variable. The price uncerta...
Pascal Michaillat, Shmuel S. Oren