Sciweavers

707 search results - page 16 / 142
» Solving path problems on the GPU
Sort
View
ICC
2007
IEEE
162views Communications» more  ICC 2007»
15 years 3 months ago
LSP and Back Up Path Setup in MPLS Networks Based on Path Criticality Index
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...
Ali Tizghadam, Alberto Leon-Garcia
IROS
2006
IEEE
131views Robotics» more  IROS 2006»
15 years 5 months ago
Support Vector Path Planning
— This paper describes a unique approach of applying a pattern classification technique to robot path planning. A collision-free path connecting a start and a goal point provide...
Jun Miura
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
15 years 5 months ago
Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and ...
Andrew Lim, Brian Rodrigues, Fei Xiao
ANOR
2008
171views more  ANOR 2008»
14 years 12 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
MP
2008
81views more  MP 2008»
14 years 11 months ago
An inexact primal-dual path following algorithm for convex quadratic SDP
Abstract We propose primal-dual path-following Mehrotra-type predictorcorrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{1 2 ...
Kim-Chuan Toh