4797 search results - page 28 / 960 » The complexity of partition tasks |
TAMODIA
2004
13 years 10 months ago
2004
This paper takes a pragmatic approach to the design of a task analysis support tool. Instead of proposing a new approach to analysis, it looks at the common requirements for provi...
COLOGNETWENTE
2010
13 years 7 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
MASCOTS
2003
13 years 10 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
WG
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...