4860 search results - page 637 / 972 » SNPs Problems, Complexity, and Algorithms |
167
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
The requirements of real-world data mining problems vary extensively. It is plausible to assume that some of these requirements can be expressed as application-specific performan...
176
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
In this paper, we present novel algorithms that effectively combine physical layout and early logic synthesis to improve overall design quality. In addition, we employ partitionin...
183
click to vote
ISPD
2010
ACM
16 years 1 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
217
click to vote
SASO
2009
IEEE
16 years 1 months ago
2009
IEEE
—The complexity of distributed computing systems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and ...
180
click to vote
ESTIMEDIA
2009
Springer
16 years 1 months ago
2009
Springer
— The complexity of today’s embedded systems forces designers to model and simulate systems and their components to explore the wide range of design choices. Such design space ...