Sciweavers

7648 search results - page 384 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 10 months ago
Multi-niche crowding in the development of parallel genetic simulated annealing
In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from ...
Zhi-Gang Wang, Mustafizur Rahman 0002, Yoke-San Wo...
ICDM
2006
IEEE
108views Data Mining» more  ICDM 2006»
15 years 10 months ago
Minimum Enclosing Spheres Formulations for Support Vector Ordinal Regression
We present two new support vector approaches for ordinal regression. These approaches find the concentric spheres with minimum volume that contain most of the training samples. B...
Shirish Krishnaj Shevade, Wei Chu
JOTA
2011
149views more  JOTA 2011»
14 years 11 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
15 years 10 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan
ISCA
1995
IEEE
93views Hardware» more  ISCA 1995»
15 years 8 months ago
Optimizing Memory System Performance for Communication in Parallel Computers
Communicationin aparallel systemfrequently involvesmoving data from the memory of one node to the memory of another; this is the standard communication model employedin message pa...
Thomas Stricker, Thomas R. Gross