194 search results - page 5 / 39 » A new partitioning method for architectural environments |
DAC
1989
ACM
13 years 11 months 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 ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
DAC
1996
ACM
13 years 12 months ago
1996
ACM
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
ASSETS
2006
ACM
14 years 1 months ago
2006
ACM
In previous work we have presented a prototype of an assistant system for the blind that can be used for self-localization and interactive object identification of static objects ...