Sciweavers

8431 search results - page 398 / 1687
» Algorithmically Independent Sequences
Sort
View
GECCO
2004
Springer
16 years 7 days ago
How Are We Doing? Predicting Evolutionary Algorithm Performance
Abstract. Given an evolutionary algorithm for a problem and an instance of the problem, the results of several trials of the EA on the instance constitute a sample from the distrib...
Mark A. Renslow, Brenda Hinkemeyer, Bryant A. Juls...
INFOCOM
2003
IEEE
16 years 4 days ago
Design and Analysis of an MST-Based Topology Control Algorithm
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this al...
Ning Li, Jennifer C. Hou, Lui Sha
FORMATS
2007
Springer
15 years 10 months ago
CSL Model Checking Algorithms for Infinite-State Structured Markov Chains
Jackson queueing networks (JQNs) are a very general class of queueing networks that find their application in a variety of settings. The state space of the continuous-time Markov c...
Anne Remke, Boudewijn R. Haverkort
SIROCCO
2008
15 years 8 months ago
Distributed Approximation Algorithm for Resource Clustering
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is...
Olivier Beaumont, Nicolas Bonichon, Philippe Ducho...
IJON
2006
96views more  IJON 2006»
15 years 6 months ago
Quasi-optimal EASI algorithm based on the Score Function Difference (SFD)
Equivariant Adaptive Separation via Independence (EASI) is one of the most successful algorithms for Blind Source Separation (BSS). However, the user has to choose nonlinearities,...
Samareh Samadi, Massoud Babaie-Zadeh, Christian Ju...