263 search results - page 17 / 53 » Path partitions of hypercubes |
DAC
1989
ACM
14 years 15 days ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
EAAI
2007
13 years 8 months ago
2007
This paper presents a swarm intelligence based approach to optimally partition combinational CMOS circuits for pseudoexhaustive testing. The partitioning algorithm ensures reducti...
IEEEPACT
2009
IEEE
2009
IEEE
Soft-OLP: Improving Hardware Cache Performance through Software-Controlled Object-Level Partitioning
14 years 3 months ago
—Performance degradation of memory-intensive programs caused by the LRU policy’s inability to handle weaklocality data accesses in the last level cache is increasingly serious ...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
— The paper studies the coordinated path following problem, namely, steering a group of unicycles to a given path while achieving an inter-vehicle formation pattern. A novel hybr...