Sciweavers

3678 search results - page 147 / 736
» On the Stable Paths Problem
Sort
View
ISSAC
2007
Springer
91views Mathematics» more  ISSAC 2007»
16 years 18 days ago
Generation and optimisation of code using coxeter lattice paths
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...
Thomas J. Ashby, Anthony D. Kennedy, Stephen M. Wa...
ISAAC
2003
Springer
92views Algorithms» more  ISAAC 2003»
15 years 11 months ago
Wavelength Conversion in Shortest-Path All-Optical Networks
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...
Thomas Erlebach, Stamatis Stefanakos
DAGSTUHL
2006
15 years 7 months ago
Coxeter Lattice Paths
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...
Thomas J. Ashby, Anthony D. Kennedy, Stephen M. Wa...
ICMCS
2009
IEEE
130views Multimedia» more  ICMCS 2009»
15 years 4 months ago
DVBMN-l: delay variation bounded multicast network with multiple paths
Distributed Multi-party/Multi-stream systems require a multicast subnetwork capable of satisfying QoS constraints such as Delay and Delay Variation Bound so that the messages reac...
Abhishek Bhattacharya, Zhenyu Yang
AAAI
2012
13 years 8 months ago
A Multi-Path Compilation Approach to Contingent Planning
We describe a new sound and complete method for compiling contingent planning problems with sensing actions into classical planning. Our method encodes conditional plans within a ...
Ronen I. Brafman, Guy Shani