Sciweavers

277 search results - page 13 / 56
» Using the feasible set method for rezoning in ALE
Sort
View
IEAAIE
2001
Springer
15 years 2 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
69
Voted
ECBS
2008
IEEE
115views Hardware» more  ECBS 2008»
15 years 4 months ago
Optimizing Design for Variability Using Traceability Links
Software systems have to provide flexibility by implementing variability. Existing design methodologies do not support means for optimizing the design for variability and for mea...
Matthias Riebisch, Robert Brcina
DAC
1994
ACM
15 years 1 months ago
Permissible Observability Relations in FSM Networks
Previous attempts to capture the phenomenon of output don't care sequencesfor a componentin an FSM network have been incomplete. We demonstrate that output don't care se...
Huey-Yih Wang, Robert K. Brayton
BMCBI
2010
108views more  BMCBI 2010»
14 years 9 months ago
Confronting two-pair primer design for enzyme-free SNP genotyping based on a genetic algorithm
Background: Polymerase chain reaction with confronting two-pair primers (PCR-CTPP) method produces allelespecific DNA bands of different lengths by adding four designed primers an...
Cheng-Hong Yang, Yu-Huei Cheng, Li-Yeh Chuang, Hsu...
ACISICIS
2007
IEEE
15 years 4 months ago
A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
Mauritsius Tuga, Regina Berretta, Alexandre Mendes