Sciweavers

516 search results - page 89 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 10 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
GECCO
2009
Springer
14 years 4 months ago
Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
Philipp Rohlfshagen, Per Kristian Lehre, Xin Yao
EMSOFT
2004
Springer
14 years 3 months ago
Practical PACE for embedded systems
In current embedded systems, one of the major concerns is energy conservation. The dynamic voltage-scheduling (DVS) framework, which involves dynamically adjusting the voltage and...
Ruibin Xu, Chenhai Xi, Rami G. Melhem, Daniel Moss...
MOBICOM
2003
ACM
14 years 3 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
BMCBI
2007
172views more  BMCBI 2007»
13 years 9 months ago
Bayesian approaches to reverse engineer cellular systems: a simulation study on nonlinear Gaussian networks
Background: Reverse engineering cellular networks is currently one of the most challenging problems in systems biology. Dynamic Bayesian networks (DBNs) seem to be particularly su...
Fulvia Ferrazzi, Paola Sebastiani, Marco Ramoni, R...