2314 search results - page 318 / 463 » Minimal Partitions of a Graph |
131
Voted
WALCOM
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
127
click to vote
ECRTS
2007
IEEE
15 years 10 months ago
2007
IEEE
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend ...
134
Voted
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract Minimizing the energy consumption of target tracking using a mobile sensor network is proved to be NPcomplete. Based on proximity graph, an approximately optimal solution ...
126
click to vote
FROCOS
2007
Springer
15 years 10 months ago
2007
Springer
Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...
135
Voted
CLUSTER
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...