Sciweavers

137 search results - page 15 / 28
» Optimising Node Coordinates for the Shortest Path Problem
Sort
View
ICPP
2009
IEEE
13 years 5 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
ANOR
2008
171views more  ANOR 2008»
13 years 7 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
TON
2010
158views more  TON 2010»
13 years 5 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
ICRA
2010
IEEE
172views Robotics» more  ICRA 2010»
13 years 5 months ago
Coordinated multi-robot real-time exploration with connectivity and bandwidth awareness
— While there has been substantial progress for multi-robot exploration of an unknown area, little attention has been given to communication, especially bandwidth constraints in ...
Yuanteng Pei, Matt W. Mutka, Ning Xi
JCO
2006
126views more  JCO 2006»
13 years 7 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li