425 search results - page 36 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
IPPS
1997
IEEE
14 years 29 days ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
ANOR
2008
13 years 8 months ago
2008
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...
EMMCVPR
2003
Springer
14 years 1 months ago
2003
Springer
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
SIGGRAPH
1999
ACM
14 years 1 months ago
1999
ACM
Realistic acoustic modeling is essential for spatializing sound in distributed virtual environments where multiple networked users move around and interact visually and aurally in...
IWQOS
2001
Springer
14 years 1 months ago
2001
Springer
Ad-hoc wireless networks consist of mobile nodes interconnected by multi-hop wireless paths. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastru...