Sciweavers

303 search results - page 55 / 61
» Traveling Salesman Problem with Transportation
Sort
View
IUI
2009
ACM
13 years 11 months 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 11 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
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
13 years 11 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...
ISLPED
2007
ACM
97views Hardware» more  ISLPED 2007»
13 years 8 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 8 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