Sciweavers

11328 search results - page 45 / 2266
» Timed Branching Processes
Sort
View
KBSE
2003
IEEE
15 years 7 months ago
Automated Software Testing Using a Metaheuristic Technique Based on Tabu Search
The use of techniques for automating the generation of software test cases is very important as it can reduce the time and cost of this process. The latest methods for automatic g...
Eugenia Díaz, Javier Tuya, Raquel Blanco
HICSS
2002
IEEE
95views Biometrics» more  HICSS 2002»
15 years 7 months ago
Simulation Spectrum and Stability Models
In this paper, we define a continuum of modeling styles, ranging from collections of very simple agents on one end to collections of very complex agents at the other end, and a s...
Christopher Landauer
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
14 years 8 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
FUIN
2002
63views more  FUIN 2002»
15 years 1 months ago
Probabilistic Cluster Unfoldings
Abstract. This article introduces probabilistic cluster branching processes, a probabilistic unfolding semantics for untimed Petri nets, with no structural or safety assumptions, g...
Stefan Haar
IWPEC
2009
Springer
15 years 8 months ago
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
Henning Fernau, Joachim Kneis, Dieter Kratsch, Ale...