1964 search results - page 34 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
ECRTS
2004
IEEE
13 years 11 months ago
2004
IEEE
We present an approach to partitioning and mapping for multicluster embedded systems consisting of time-triggered and eventtriggered clusters, interconnected via gateways. We have...
ACL
1998
13 years 9 months ago
1998
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these att...
SWAT
2010
Springer
14 years 23 days ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
ISPD
2010
ACM
14 years 2 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, ...
ICCAD
1999
IEEE
14 years 11 hour ago
1999
IEEE
Improving logic density by time-sharing, time-multiplexed FPGAs (TMFPGAs) have become an important research topic for reconfigurable computing. Due to the precedence and capacity ...