Sciweavers

599 search results - page 49 / 120
» The traveling salesman problem
Sort
View
CEC
2005
IEEE
14 years 1 months ago
A quantitative approach for validating the building-block hypothesis
The building blocks are common structures of high-quality solutions. Genetic algorithms often assume the building-block hypothesis. It is hypothesized that the high-quality solutio...
Chatchawit Aporntewan, Prabhas Chongstitvatana
AAIM
2005
Springer
110views Algorithms» more  AAIM 2005»
14 years 1 months ago
Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms
Abstract. The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorith...
Hoang Trung Dinh, Abdullah Al Mamun, Hieu T. Dinh
IUI
2009
ACM
14 years 18 days ago
Automatic design of a control interface for a synthetic face
Getting synthetic faces to display natural facial expressions is essential to enhance the interaction between human users and virtual characters. Yet traditional facial control te...
Nicolas Stoiber, Renaud Séguier, Gaspard Br...
IRREGULAR
1997
Springer
14 years 2 days ago
Programming with Shared Data Abstractions
ing with shared data abstractions Simon Dobson1 and Don Goodeve2 1 Well-Founded Systems Unit, CLRC Rutherford Appleton Laboratory, UK 2 School of Computer Studies, University of Le...
Simon A. Dobson, Don Goodeve
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
13 years 12 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...