Sciweavers

6437 search results - page 31 / 1288
» Parallel Algorithms for Arrangements
Sort
View
ICWN
2004
13 years 11 months ago
Does Cluster Architecture Enhance Performance Scalability of Clustered Mobile Ad Hoc Networks?
This paper explains and evaluates the performance of a cluster architecture-based routing protocol, called Link Cluster Protocol (LCP), in mobile ad hoc networks (MANETs). LCP show...
Myeong L. Lim, Chansu Yu
EMO
2005
Springer
110views Optimization» more  EMO 2005»
14 years 3 months ago
Parallelization of Multi-objective Evolutionary Algorithms Using Clustering Algorithms
Abstract. While Single-Objective Evolutionary Algorithms (EAs) parallelization schemes are both well established and easy to implement, this is not the case for Multi-Objective Evo...
Felix Streichert, Holger Ulmer, Andreas Zell
ESA
2009
Springer
74views Algorithms» more  ESA 2009»
14 years 4 months ago
On Inducing Polygons and Related Problems
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prov...
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc ...
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 4 months ago
A novel generative encoding for exploiting neural network sensor and output geometry
A significant problem for evolving artificial neural networks is that the physical arrangement of sensors and effectors is invisible to the evolutionary algorithm. For example,...
David B. D'Ambrosio, Kenneth O. Stanley
ICDM
2006
IEEE
135views Data Mining» more  ICDM 2006»
14 years 4 months ago
Discovering Frequent Poly-Regions in DNA Sequences
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient approaches are propose...
Panagiotis Papapetrou, Gary Benson, George Kollios