Sciweavers

101 search results - page 14 / 21
» General Algorithms for Testing the Ambiguity of Finite Autom...
Sort
View
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
13 years 11 months ago
Memory analysis and significance test for agent behaviours
Many agent problems in a grid world have a restricted sensory information and motor actions. The environmental conditions need dynamic processing of internal memory. In this paper...
DaeEun Kim
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 4 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
OOPSLA
2010
Springer
13 years 5 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
14 years 7 months ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
IWRIDL
2006
ACM
141views Education» more  IWRIDL 2006»
14 years 1 months ago
Shallow syntax analysis in Sanskrit guided by semantic nets constraints
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...
Gérard P. Huet