Sciweavers

1291 search results - page 81 / 259
» Arithmetic program paths
Sort
View
CN
2002
87views more  CN 2002»
13 years 9 months ago
Comparison of two path restoration schemes in self-healing networks
The state-independent (SI) and state-dependent (SD) path restoration schemes for self-healing networks are studied in this paper. The integer programming (IP) formulations for the...
Yijun Xiong, Lorne Mason
CPAIOR
2009
Springer
14 years 4 months ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
CISS
2008
IEEE
14 years 4 months ago
Optimal path planning for mobile backbone networks
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
Anand Srinivas, Eytan Modiano
IFIP
2004
Springer
14 years 3 months ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...
CP
2003
Springer
14 years 3 months ago
Improved Algorithms for Max-restricted Path Consistency
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
Fabrizio Grandoni, Giuseppe F. Italiano