6274 search results - page 1035 / 1255 » From query complexity to computational complexity |
155
click to vote
GD
2005
Springer
15 years 11 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
150
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
147
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Genetic representations that do not employ a one-to-one mapping of genotype to phenotype are known as indirect encodings, and can be much more efficient than direct encodings for ...
191
click to vote
HIPC
2005
Springer
15 years 11 months ago
2005
Springer
Several challenging new applications demand the ability to do data mining on resource constrained devices. One such application is that of monitoring physiological data streams ob...
154
click to vote
ICN
2005
Springer
15 years 11 months ago
2005
Springer
Network infrastructures are nowadays getting more and more complex as security considerations and technical needs like network address translation are blocking traffic and protocol...