Sciweavers

206 search results - page 8 / 42
» Probabilistic Analysis of Large Finite State Machines
Sort
View
VOSS
2004
Springer
152views Mathematics» more  VOSS 2004»
15 years 5 months ago
Symbolic Representations and Analysis of Large Probabilistic Systems
Abstract. This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems. Symbolic approaches derive their efficiency by...
Andrew S. Miner, David Parker
EVOW
2003
Springer
15 years 4 months ago
Landscape State Machines: Tools for Evolutionary Algorithm Performance Analyses and Landscape/Algorithm Mapping
Abstract. Many evolutionary algorithm applications involve either fitness functions with high time complexity or large dimensionality (hence very many fitness evaluations will typi...
David Corne, Martin J. Oates, Douglas B. Kell
VALUETOOLS
2006
ACM
162views Hardware» more  VALUETOOLS 2006»
15 years 5 months ago
Using UML state machines and petri nets for the quantitative investigation of ETCS
This paper proposes the modeling of technical systems and their behavior by means of Unified Modeling Language (UML) State Machines and the extending UML Profile for Schedulabil...
Jan Trowitzsch, Armin Zimmermann
TEC
2008
127views more  TEC 2008»
14 years 11 months ago
Fingerprinting: Visualization and Automatic Analysis of Prisoner's Dilemma Strategies
Fingerprinting is a technique for generating a representation-independent functional signature for a game playing agent. Fingerprints can be used to compare agents across represent...
Daniel A. Ashlock, Eun-Youn Kim
109
Voted
FASE
2006
Springer
15 years 3 months ago
Regular Inference for State Machines with Parameters
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
Therese Berg, Bengt Jonsson, Harald Raffelt