Sciweavers

8824 search results - page 157 / 1765
» On the Complexity of Real Functions
Sort
View
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
15 years 10 months ago
Reducing the space-time complexity of the CMA-ES
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
James N. Knight, Monte Lunacek
COCOON
2008
Springer
15 years 6 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
ICA
2004
Springer
15 years 10 months ago
ICA Using Kernel Entropy Estimation with NlogN Complexity
Abstract. Mutual information (MI) is a common criterion in independent component analysis (ICA) optimization. MI is derived from probability density functions (PDF). There are scen...
Sarit Shwartz, Michael Zibulevsky, Yoav Y. Schechn...
ICDCS
2008
IEEE
15 years 11 months ago
Online Optimization for Latency Assignment in Distributed Real-Time Systems
As distributed real-time applications gain in popularity, a key challenge is to allocate resources so that diverse realtime requirements (including non-real-time applications), di...
Cristian Lumezanu, Sumeer Bhola, Mark Astley
RTSS
2007
IEEE
15 years 11 months ago
Robust Priority Assignment for Fixed Priority Real-Time Systems
This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a “robust” priority ordering: the most...
Robert I. Davis, Alan Burns