Sciweavers

2419 search results - page 332 / 484
» A Formal Approach to Software Testing
Sort
View
123
Voted
PR
1998
86views more  PR 1998»
15 years 2 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...
117
Voted
AMAST
2008
Springer
15 years 4 months ago
Service Specification and Matchmaking Using Description Logic
ed Abstract an extended abstract of [11]. Service-oriented computing is emerging as a new paradigm based on autonomous, platform-independent computational entities, called services...
M. Birna van Riemsdijk, Rolf Hennicker, Martin Wir...
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
15 years 8 months ago
Generalized benchmark generation for dynamic combinatorial problems
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
Abdulnasser Younes, Paul H. Calamai, Otman A. Basi...
143
Voted
SIGMOD
2011
ACM
222views Database» more  SIGMOD 2011»
14 years 5 months ago
Data generation using declarative constraints
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
Arvind Arasu, Raghav Kaushik, Jian Li
140
Voted
ICONS
2009
IEEE
15 years 9 months ago
Modeling System Safety Requirements Using Input/Output Constraint Meta-automata
Most recent software related accidents have been system accidents. To validate the absence of system hazards concerning dysfunctional interactions, industrials call for approaches...
Zhe Chen, Gilles Motet