Sciweavers

1310 search results - page 110 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
GIS
2011
ACM
14 years 1 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira
CEC
2008
IEEE
15 years 4 months ago
A multi-agent based evolutionary algorithm in non-stationary environments
— In this paper, a multi-agent based evolutionary algorithm (MAEA) is introduced to solve dynamic optimization problems. The agents simulate living organism features and co-evolv...
Yang Yan, Hongfeng Wang, Dingwei Wang, Shengxiang ...
ICCTA
2007
IEEE
15 years 4 months ago
Covering a Set of Points in a Plane Using Two Parallel Rectangles
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
Chandan Saha, Sandip Das
EOR
2007
87views more  EOR 2007»
14 years 10 months ago
An optimal and scalable parallelization of the two-list
In this paper, we suggest a parallel algorithm based on a shared memory SIMD architecture for solving an n item subset-sum problem in time O(2n/2 /p) by using p = 2q processors, 0...
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma,...
VECPAR
2004
Springer
15 years 3 months ago
Domain Decomposition Methods for PDE Constrained Optimization Problems
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
Ernesto E. Prudencio, Richard H. Byrd, Xiao-Chuan ...