Sciweavers

2877 search results - page 55 / 576
» The Complexity of Planarity Testing
Sort
View
SOCO
2009
Springer
14 years 3 months ago
A Framework for Testing Model Composition Engines
Model composition helps designers managing complexities by modeling different system views separately, and later compose them into an integrated model. In the past years, researche...
Freddy Munoz, Benoit Baudry
IJCNN
2008
IEEE
14 years 3 months ago
Building meta-learning algorithms basing on search controlled by machine complexity
Abstract— Meta-learning helps us find solutions to computational intelligence (CI) challenges in automated way. Metalearning algorithm presented in this paper is universal and m...
Norbert Jankowski, Krzysztof Grabczewski
CORR
2011
Springer
189views Education» more  CORR 2011»
13 years 4 months ago
A Factorial Experiment on Scalability of Search Based Software Testing
Software testing is an expensive process, which is vital in the industry. Construction of the test-data in software testing requires the major cost and to decide which method to us...
Arash Mehrmand, Robert Feldt
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 9 months ago
A proof Procedure for Testing Membership in Regular Expressions
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
Keehang Kwon, Hong Pyo Ha, Jiseung Kim
IPL
2007
69views more  IPL 2007»
13 years 9 months ago
On the fixed-parameter tractability of the equivalence test of monotone normal forms
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
Matthias Hagen