Sciweavers

31387 search results - page 43 / 6278
» Abstracting abstract machines
Sort
View
CIE
2008
Springer
13 years 12 months ago
An Enhanced Theory of Infinite Time Register Machines
Abstract. Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor step...
Peter Koepke, Russell Miller
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
13 years 10 months ago
Superstate identification for state machines using search-based clustering
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
Mathew Hall, Phil McMinn, Neil Walkinshaw
JAR
2006
103views more  JAR 2006»
13 years 10 months ago
A Framework for Verifying Bit-Level Pipelined Machines Based on Automated Deduction and Decision Procedures
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
Panagiotis Manolios, Sudarshan K. Srinivasan
INFORMATICALT
2010
134views more  INFORMATICALT 2010»
13 years 7 months ago
Observability of Turing Machines: A Refinement of the Theory of Computation
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
Yaroslav D. Sergeyev, Alfredo Garro
CIT
2004
Springer
14 years 1 months ago
BioPubMiner: Machine Learning Component-Based Biomedical Information Analysis Platform
Abstract. In this paper we introduce BioPubMiner, a machine learning component-based platform for biomedical information analysis. BioPubMiner employs natural language processing t...
Jae-Hong Eom, Byoung-Tak Zhang