Sciweavers

31387 search results - page 38 / 6278
» Abstracting abstract machines
Sort
View
B
1998
Springer
14 years 2 months ago
Graphical Design of Reactive Systems
Reactive systems can be designed graphically using statecharts. This paper presents a scheme for the translation of statecharts into the Abstract Machine Notation (AMN) of the B me...
Emil Sekerinski
FASE
2000
Springer
14 years 1 months ago
Formal System Development with KIV
state-based approach KIV uses abstract state machines (ASMs, [5]) over algebraically specified data types. The semantics of an ASM is the set of
Michael Balser, Wolfgang Reif, Gerhard Schellhorn,...
BMCBI
2007
105views more  BMCBI 2007»
13 years 10 months ago
Constrained hidden Markov models for population-based haplotyping
abstract Niels Landwehr1 , Taneli Mielik¨ainen2 , Lauri Eronen2 , Hannu Toivonen1,2 , and Heikki Mannila2 1 Machine Learning Lab, Dept. of Comp. Science, University of Freiburg, G...
Niels Landwehr, Taneli Mielikäinen, Lauri Ero...
ICML
2008
IEEE
14 years 10 months ago
Multiple instance ranking
This paper introduces a novel machine learning model called multiple instance ranking (MIRank) that enables ranking to be performed in a multiple instance learning setting. The mo...
Charles Bergeron, Jed Zaretzki, Curt M. Breneman, ...
ICALP
2005
Springer
14 years 3 months ago
Noisy Turing Machines
Abstract. Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈ Π0 2 ) computational power (as noise level tends to 0) is obt...
Eugene Asarin, Pieter Collins