40 search results - page 2 / 8 » Convergence Time Analysis for the Multi-objective Counting O... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
GECCO
2000
Springer
13 years 8 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
IPPS
2002
IEEE
13 years 10 months ago
2002
IEEE
Abstract— In this paper, we present a novel and comprehensive resource management solution for the autonomous hot-spot convergence system (AHSCS) that uses sensor web. This solut...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
DAC
2010
ACM
13 years 5 months ago
2010
ACM
Given the increasing complexity of multi-processor systems-onchip, a wide range of parameters must be tuned to find the best trade-offs in terms of the selected system figures of ...