Sciweavers

1927 search results - page 105 / 386
» UMDAs for dynamic optimization problems
Sort
View
89
Voted
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 1 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
102
Voted
GLOBECOM
2008
IEEE
15 years 7 months ago
Dynamic Wavelength Routing in WDM Networks under Multiple Signal Quality Constraints
—Most research works in routing and design of optical networks assume that the optical medium can carry signals without any bit error. However, the physical impairments on the op...
Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan ...
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
15 years 6 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
CODES
2004
IEEE
15 years 4 months ago
Dynamic overlay of scratchpad memory for energy minimization
The memory subsystem accounts for a significant portion of the aggregate energy budget of contemporary embedded systems. Moreover, there exists a large potential for optimizing th...
Manish Verma, Lars Wehmeyer, Peter Marwedel
AUTOMATICA
2006
106views more  AUTOMATICA 2006»
15 years 24 days ago
Decentralized receding horizon control for large scale dynamically decoupled systems
A detailed study on the design of decentralized Receding Horizon Control (RHC) schemes for decoupled systems is presented. An optimal control problem is formulated for a set of de...
Tamás Keviczky, Francesco Borrelli, Gary J....