Sciweavers

361 search results - page 34 / 73
» Approximate counting by dynamic programming
Sort
View
CSMR
2007
IEEE
14 years 1 months ago
The Dynamic Function Coupling Metric and Its Use in Software Evolution
Many of the existing techniques for impact set computation in change propagation and regression testing are approximate for the sake of efficiency. A way to improve precision is ...
Árpád Beszédes, Tamás ...
CN
2006
75views more  CN 2006»
13 years 7 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
INFOCOM
2003
IEEE
14 years 25 days ago
Modeling Malware Spreading Dynamics
— In this paper we present analytical techniques that can be used to better understand the behavior of malware, a generic term that refers to all kinds of malicious software prog...
Michele Garetto, Weibo Gong, Donald F. Towsley
SPIRE
2005
Springer
14 years 1 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
IPL
2007
94views more  IPL 2007»
13 years 7 months ago
The finite horizon investor problem with a budget constraint
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
Asaf Levin