644 search results - page 111 / 129 » Decomposition Complexity |
100
Voted
DAC
2009
ACM
16 years 1 months ago
2009
ACM
In double patterning lithography (DPL), coloring conflict and stitch minimization are the two main challenges. Post layout decomposition algorithm [1] [2]may not be enough to achi...
113
click to vote
PODS
2007
ACM
16 years 18 days ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
103
click to vote
HYBRID
2010
Springer
15 years 7 months ago
2010
Springer
The complexity of physical and engineering systems, both in terms of the governing physical phenomena and the number of subprocesses involved, is mirrored in ever more complex mat...
109
Voted
CEC
2009
IEEE
15 years 7 months ago
2009
IEEE
— Legged robots show promise for complex mobility tasks, such as navigating rough terrain, but the design of their control software is both challenging and laborious. Traditional...
95
Voted
COCO
2009
Springer
15 years 7 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...