Sciweavers

332 search results - page 55 / 67
» Traveling salesman path problems
Sort
View
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 15 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
13 years 12 months 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
ISLPED
2007
ACM
97views Hardware» more  ISLPED 2007»
13 years 9 months ago
Detailed placement for leakage reduction using systematic through-pitch variation
We present a novel detailed placement technique that accounts for systematic through-pitch variations to reduce leakage. Leakage depends nearly exponentially on linewidth (gate le...
Andrew B. Kahng, Swamy Muddu, Puneet Sharma
CEC
2010
IEEE
13 years 9 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius