1189 search results - page 238 / 238 » Graph Subcolorings: Complexity and Algorithms |
ASPDAC
2006
ACM
13 years 11 months ago
2006
ACM
— The rapid increase in IC design complexity and wide-spread use of intellectual-property (IP) blocks have made the so-called mixed-size placement a very important topic in recen...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
MICRO
2005
IEEE
13 years 11 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
CLOUD
2010
ACM
13 years 10 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...