Sciweavers

613 search results - page 69 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
82
Voted
DAC
2008
ACM
16 years 3 months ago
Topological routing to maximize routability for package substrate
Compared with on-chip routers, the existing commercial tools for off-chip routing have a much lower routability and often result in a large number of unrouted nets for manual rout...
Shenghua Liu, Guoqiang Chen, Tom Tong Jing, Lei He...
122
Voted
JMLR
2010
155views more  JMLR 2010»
14 years 9 months ago
Bayesian Gaussian Process Latent Variable Model
We introduce a variational inference framework for training the Gaussian process latent variable model and thus performing Bayesian nonlinear dimensionality reduction. This method...
Michalis Titsias, Neil D. Lawrence
128
Voted
ATAL
2010
Springer
15 years 3 months ago
Distributed coordination of mobile agent teams: the advantage of planning ahead
We consider the problem of coordinating a team of agents engaged in executing a set of inter-dependent, geographically dispersed tasks in an oversubscribed and uncertain environme...
Laura Barbulescu, Zachary B. Rubinstein, Stephen F...
125
Voted
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 8 months ago
Optimization of passenger car design for the mitigation of pedestrian head injury using a genetic algorithm
The problem of pedestrian injury is a significant one throughout the world. In 2001, there were 4724 pedestrian fatalities in Europe and 4882 in the US. Significant advances have ...
Emma Carter, Steve Ebdon, Clive Neal-Sturgess
125
Voted
TCS
1998
15 years 2 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...