1984 search results - page 187 / 397 » Variable mesh optimization for continuous optimization probl... |
140
Voted
DAM
2007
15 years 6 months ago
2007
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
161
click to vote
WEA
2007
Springer
16 years 16 days ago
2007
Springer
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
136
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
204
click to vote
EUROGP
2007
Springer
15 years 8 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
131
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper, we study the optimal deployment pattern problem in wireless sensor networks (WSNs). We propose a new set of patterns, particularly when sensors’ communication r...