Sciweavers

1857 search results - page 152 / 372
» Minimum Degree Orderings
Sort
View
ICTAI
1993
IEEE
15 years 10 months ago
Short Term Unit-Commitment Using Genetic Algorithms
Unit commitment is a complex decision-making process because of multiple constraints which must not be violated while nding the optimal or a near-optimal commitment schedule. This...
Dipankar Dasgupta, Douglas R. McGregor
ETS
2007
IEEE
128views Hardware» more  ETS 2007»
15 years 8 months ago
Selecting Power-Optimal SBST Routines for On-Line Processor Testing
Software-Based Self-Test (SBST) has emerged as an effective strategy for on-line testing of processors integrated in non-safety critical embedded system applications. Among the mo...
Andreas Merentitis, Nektarios Kranitis, Antonis M....
DM
2008
100views more  DM 2008»
15 years 6 months ago
Adaptive group testing for consecutive positives
Motivated from an application to DNA library screening, Balding and Torney [1] and Colbourn [4] studied the following group testing for consecutive positives. Suppose Vn = {v1 v2 ...
Justie Su-tzu Juan, Gerard J. Chang
TCAD
2008
106views more  TCAD 2008»
15 years 6 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
14 years 10 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache