Sciweavers

474 search results - page 42 / 95
» On Multicast Path Finding Algorithms
Sort
View
ICPP
1998
IEEE
13 years 12 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
13 years 11 months ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
SIGPRO
2008
201views more  SIGPRO 2008»
13 years 7 months ago
Multichannel blind seismic deconvolution using dynamic programming
In this paper, we present an algorithm for multichannel blind deconvolution of seismic signals, which exploits lateral continuity of earth layers by dynamic programming approach. ...
Alon Heimer, Israel Cohen
ICFP
2008
ACM
14 years 7 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
EMSOFT
2006
Springer
13 years 11 months ago
Scheduling for multi-threaded real-time programs via path planning
The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs...
Thao Dang, Philippe Gerner