TimGA: A genetic algorithm for drawing undirected graphs.
Eloranta, Timo, Mäkinen, Erkki (2001)
Divulgaciones Matemáticas
Similarity:
Eloranta, Timo, Mäkinen, Erkki (2001)
Divulgaciones Matemáticas
Similarity:
Barth, Wilhelm, Mutzel, Petra, Jünger, Michael (2004)
Journal of Graph Algorithms and Applications
Similarity:
Lyons, Kelly A., Meijer, Henk, Rappaport, David (1998)
Journal of Graph Algorithms and Applications
Similarity:
Castelló, Rodolfo (2002)
Journal of Graph Algorithms and Applications
Similarity:
Safro, Ilya, Ron, Dorit, Brandt, Achi (2006)
Journal of Graph Algorithms and Applications
Similarity:
Harel, David, Koren, Yehuda (2002)
Journal of Graph Algorithms and Applications
Similarity:
Calamoneri, Tiziana, Jannelli, Simone, Petreschi, Rossella (1999)
Journal of Graph Algorithms and Applications
Similarity:
Eschbach, Thomas, Guenther, Wolfgang, Becker, Bernd (2006)
Journal of Graph Algorithms and Applications
Similarity:
Suderman, Matthew, Whitesides, Sue (2005)
Journal of Graph Algorithms and Applications
Similarity:
Hadda Cherroun, Alain Darte, Paul Feautrier (2007)
RAIRO - Operations Research
Similarity:
The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target...
Conte, Donatello, Foggia, Pasquale, Vento, Mario (2007)
Journal of Graph Algorithms and Applications
Similarity:
Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi (1999)
Journal of Graph Algorithms and Applications
Similarity:
Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)
Journal of Graph Algorithms and Applications
Similarity: