Sciweavers

1289 search results - page 118 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
NICSO
2010
Springer
15 years 1 months ago
Accelerated Genetic Algorithms with Markov Chains
t] Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for comple...
Guan Wang, Chen Chen, Kwok Yip Szeto
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
14 years 11 months ago
Aiming for a theoretically tractable CSA variant by means of empirical investigations
Evolution Strategies (ES) for black-box optimization of a function f : Rn → R are investigated. Namely, we consider the cumulative step-size adaptation (CSA) for the variance of...
Jens Jägersküpper, Mike Preuss
CSDA
2007
109views more  CSDA 2007»
14 years 10 months ago
Improving the computation of censored quantile regressions
Abstract. Censored quantile regressions (CQR) are a valuable tool in economics and engineering. The computation of estimators is highly complex and the performance of standard meth...
Bernd Fitzenberger, Peter Winker
VTC
2008
IEEE
164views Communications» more  VTC 2008»
15 years 4 months ago
Resource Allocation for Downlink Spectrum Sharing in Cognitive Radio Networks
— We consider a resource allocation problem for spectrum sharing in cognitive radio networks. Specifically, we investigate the joint subchannel, rate and power allocation for se...
Patrick Mitran, Long Le, Catherine Rosenberg, Andr...
ATAL
2006
Springer
15 years 1 months ago
On Efficient Procedures for Multi-issue Negotiation
This paper studies bilateral, multi-issue negotiation between self-interested agents with deadlines. There are a number of procedures for negotiating the issues and each of these g...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....