Sciweavers

371 search results - page 16 / 75
» A New Method for Interoperability Test Generation
Sort
View
ASWEC
2007
IEEE
15 years 3 months ago
Managing Conflicts When Using Combination Strategies to Test Software
Testers often represent systems under test in input parameter models. These contain parameters with associated values. Combinations of parameter values, with one value for each pa...
Mats Grindal, Jeff Offutt, Jonas Mellin
IJCAI
1997
15 years 1 months ago
Hidden Gold in Random Generation of SAT Satisfiable Instances
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...
Thierry Castell, Michel Cayrol
ICA
2010
Springer
14 years 12 months ago
SMALLbox - An Evaluation Framework for Sparse Representations and Dictionary Learning Algorithms
SMALLbox is a new foundational framework for processing signals, using adaptive sparse structured representations. The main aim of SMALLbox is to become a test ground for explorati...
Ivan Damnjanovic, Matthew E. P. Davies, Mark D. Pl...
EURODAC
1995
IEEE
164views VHDL» more  EURODAC 1995»
15 years 3 months ago
Bottleneck removal algorithm for dynamic compaction and test cycles reduction
: We present a new, dynamic algorithm for test sequence compaction and test cycle reduction for combinationaland sequential circuits. Several dynamic algorithms for compaction in c...
Srimat T. Chakradhar, Anand Raghunathan
KI
2004
Springer
15 years 5 months ago
Generation of Sentence Parse Trees Using Parts of Speech
This paper proposes a new corpus-based approach for deriving syntactic structures and generating parse trees of natural language sentences. The parts of speech (word categories) of...
Tunga Güngör