Sciweavers

88 search results - page 6 / 18
» Proving the Correctness of the STG Machine
Sort
View
FUIN
2002
80views more  FUIN 2002»
13 years 7 months ago
P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines)
Abstract. The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the par...
Joaquin Aguado, Tudor Balanescu, Anthony J. Cowlin...
ENTCS
2007
88views more  ENTCS 2007»
13 years 7 months ago
Mothers of Pipelines
We present a method for pipeline verification using SMT solvers. It is based on a non-deterministic “mother pipeline” machine (MOP) that abstracts the instruction set archite...
Sava Krstic, Robert B. Jones, John O'Leary
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
13 years 8 months ago
Evolving machine microprograms
The realization of a control unit can be done using a complex circuitry or microprogramming. The latter may be considered as an alternative method of implementation of machine ins...
Pedro A. Castillo Valdivieso, G. Fernández,...
ICPR
2002
IEEE
14 years 8 months ago
Incorporating Conditional Independence Assumption with Support Vector Machines to Enhance Handwritten Character Segmentation Per
Learning Bayesian Belief Networks (BBN) from corpora and incorporating the extracted inferring knowledge with a Support Vector Machines (SVM) classifier has been applied to charac...
Manolis Maragoudakis, Ergina Kavallieratou, Nikos ...
ECCV
1998
Springer
14 years 9 months ago
Is Machine Colour Constancy Good Enough?
This paper presents a negative result: current machine colour constancy algorithms are not good enough for colour-based object recognition. This result has surprised us since we ha...
Brian V. Funt, Kobus Barnard, Lindsay Martin