Sciweavers

389 search results - page 69 / 78
» Some natural decision problems in automatic graphs
Sort
View
EH
1999
IEEE
351views Hardware» more  EH 1999»
13 years 11 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
ICSEA
2007
IEEE
14 years 1 months ago
Test Data Generation from UML State Machine Diagrams using GAs
Automatic test data generation helps testers to validate software against user requirements more easily. Test data can be generated from many sources; for example, experience of t...
Chartchai Doungsa-ard, Keshav P. Dahal, M. Alamgir...
ESANN
2007
13 years 8 months ago
How to process uncertainty in machine learning?
Uncertainty is a popular phenomenon in machine learning and a variety of methods to model uncertainty at different levels has been developed. The aim of this paper is to motivate ...
Barbara Hammer, Thomas Villmann
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 5 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
TAL
2004
Springer
14 years 1 days ago
One Size Fits All? A Simple Technique to Perform Several NLP Tasks
Word fragments or n-grams have been widely used to perform different Natural Language Processing tasks such as information retrieval [1] [2], document categorization [3], automatic...
Daniel Gayo-Avello, Darío Álvarez Gu...