5595 search results - page 137 / 1119 » Approximation Algorithms for Clustering Problems |
157
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
132
Voted
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
119
click to vote
COR
2008
15 years 5 months ago
2008
This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...
180
click to vote
WAOA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
152
click to vote
WSC
2008
15 years 7 months ago
2008
Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential ...