1729 search results - page 300 / 346 » Bound Graph Polysemy |
125
click to vote
ICCAD
2005
IEEE
16 years 1 months ago
2005
IEEE
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
126
click to vote
ICCAD
2003
IEEE
16 years 1 months ago
2003
IEEE
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
140
Voted
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
139
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
156
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a joint congestion control and scheduling algorithm that achieves a fraction d...