Sciweavers

278 search results - page 15 / 56
» Constraint Models for the Covering Test Problem
Sort
View
GI
2009
Springer
14 years 1 months ago
Tapir: Language Support to Reduce the State Space in Model-Checking
: Model-checking is a way of testing the correctness of concurrent programs. To do so, a model of the program is proven to match properties and constraints specified by the progra...
Ronald Veldema, Michael Philippsen
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 8 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle
FLAIRS
2008
13 years 9 months ago
Feeder Setup Optimization in SMT Assembly
This paper describes an algorithm developed as a decision support system for SMT line operators and its purpose is to suggest changes in an existing feeder setup in order to impro...
Jan Kelbel, Zdenek Hanzálek
ICCD
2004
IEEE
113views Hardware» more  ICCD 2004»
14 years 5 months ago
End-to-End Testability Analysis and DfT Insertion for Mixed-Signal Paths
Increasing system complexity and test cost demands new system-level solutions for mixed-signal systems. In this paper, we present a testability analysis and DfT insertion methodol...
Sule Ozev, Alex Orailoglu
HM
2010
Springer
133views Optimization» more  HM 2010»
13 years 9 months ago
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...
Luca Di Gaspero, Johannes Gärtner, Nysret Mus...