|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12 occurrences of 12 keywords
|
|
|
Results
Found 2 publication records. Showing 2 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
32 | David Fernández-Baca |
Allocating Modules to Processors in a Distributed System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(11), pp. 1427-1436, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
execution costs, P=NP, polynomial-time epsilon -approximate algorithm, optimum assignment, almost-tree, module allocation problem, distributed system, computational complexity, complexity, graph theory, distributed processing, iteration, polynomial time, planar, bipartite, partial k-tree, local search algorithm, communication graph |
8 | Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto |
Optimal Broadcasting in Almost Trees and Partial k-trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings, pp. 432-443, 1998, Springer, 3-540-64230-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #2 of 2 (100 per page; Change: )
|
|