Sciweavers

904 search results - page 33 / 181
» The State Problem for Evolutionary Testing
Sort
View
GECCO
2010
Springer
197views Optimization» more  GECCO 2010»
13 years 12 months ago
Niching the CMA-ES via nearest-better clustering
We investigate how a niching based evolutionary algorithm fares on the BBOB function test set, knowing that most problems are not very well suited to this algorithm class. However...
Mike Preuss
TCS
2010
13 years 6 months ago
Canonical finite state machines for distributed systems
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multip...
Robert M. Hierons
COMPSAC
2002
IEEE
14 years 1 months ago
Expanding an Extended Finite State Machine to aid Testability
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in o...
Robert M. Hierons, T.-H. Kim, Hasan Ural
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
14 years 5 days ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
14 years 3 days ago
On the Complexity of Intersecting Finite State Automata
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...