2542 search results - page 191 / 509 » Computing Cartograms with Optimal Complexity |
105
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
As high-speed networks have proliferated across the globe, their topologies have become sparser due to the increased capacity of communication media and cost considerations. Relia...
113
Voted
ISPA
2005
Springer
15 years 6 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
131
Voted
COR
2011
2011
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
14 years 7 months ago
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
93
Voted
ICCV
2005
IEEE
15 years 6 months ago
2005
IEEE
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
96
Voted
JCB
2000
15 years 17 days ago
2000
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting speci...