Sciweavers

28888 search results - page 64 / 5778
» Computability and complexity in analysis
Sort
View
FLAIRS
2006
13 years 9 months ago
Sensitivity Analysis of Markovian Models
Sensitivity analysis of Markovian models amounts to computing the constants in polynomial functions of a parameter under study. To handle the computational complexity involved, we...
Theodore Charitos, Linda C. van der Gaag
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 9 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
RTS
2000
143views more  RTS 2000»
13 years 7 months ago
Fast and Precise WCET Prediction by Separated Cache and Path Analyses
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...
Henrik Theiling, Christian Ferdinand, Reinhard Wil...
PODC
2009
ACM
14 years 17 days ago
Brief announcement: locality-based aggregate computation in wireless sensor networks
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu
GECCO
2005
Springer
149views Optimization» more  GECCO 2005»
14 years 1 months ago
Parallel genetic algorithms on line topology of heterogeneous computing resources
This paper evaluates a parallel genetic algorithm (GA) on the line topology of heterogeneous computing resources. Evolution process of parallel GAs is investigated on two types of...
Yiyuan Gong, Morikazu Nakamura, Shiro Tamaki