Sciweavers

281 search results - page 27 / 57
» Concurrent Java Test Generation as a Search Problem
Sort
View
AUTOMATICA
2006
68views more  AUTOMATICA 2006»
13 years 7 months ago
Relaxed fault detection and isolation: An application to a nonlinear case study
Given a number of possibly concurrent faults (and disturbances) that may affect a nonlinear dynamic system, it may not be possible to solve the standard fault detection and isolat...
Raffaella Mattone, Alessandro De Luca
CPAIOR
2010
Springer
13 years 11 months ago
An In-Out Approach to Disjunctive Optimization
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
Matteo Fischetti, Domenico Salvagnin
TSMC
2011
324views more  TSMC 2011»
13 years 2 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
AIPS
2004
13 years 9 months ago
Conformant Planning via Heuristic Forward Search: A New Approach
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The p...
Ronen I. Brafman, Jörg Hoffmann
ISSTA
2004
ACM
14 years 1 months ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...