1813 search results - page 21 / 363 » Instance Pruning Techniques |
ICCAD
1996
IEEE
15 years 4 months ago
1996
IEEE
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed searchp...
GLVLSI
2003
IEEE
15 years 5 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
ICAD
2004
15 years 1 months ago
2004
The rapid accumulation of large collections of data has created the need for efficient and intelligent schemes for knowledge extraction and results analysis. The resulting informa...
100
click to vote
DIAGRAMS
2004
Springer
15 years 5 months ago
2004
Springer
This paper investigates whether first year programming students can be helped to understand program behaviour through the use of Object (Instance) diagrams. Students were introduce...
CEC
2009
IEEE
15 years 6 months ago
2009
IEEE
—In this paper, the DMOEA-DD, which is an improvement of DMOEA[1, 2] by using domain decomposition technique, is applied to tackle the CEC 2009 MOEA competition test instances th...