Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=2400

• Evaluation of routing algorithms for InfiniBand networks
  M.E. Gómez, J. Flich, A. Robles, P. López, J. Duato
  Lecture Notes in Computer Science 2400, 2002, pp. 775-780
• Congestion control based on transmission times
  E. Baydal, P. López, J. Duato
  Lecture Notes in Computer Science 2400, 2002, pp. 781-790
• A Dual-LAN topology with the Dual-Path Ethernet Module
  Jihoon Park, Jonggyu Park, Ilsuk Han, Hagbae Kim
  Lecture Notes in Computer Science 2400, 2002, pp. 791-794
• A fast barrier synchronization protocol for broadcast networks based on a dynamic access control
  Satoshi Fujita, Shigeaki Tagashira
  Lecture Notes in Computer Science 2400, 2002, pp. 795-798
• The hierarchical factor algorithm for all-to-all communication
  Peter Sanders, Jesper Larsson Träff
  Lecture Notes in Computer Science 2400, 2002, pp. 799-803
• Deterministic scheduling of CBR and VBR media flows on Parallel Media Servers
  Costas Mourlas
  Lecture Notes in Computer Science 2400, 2002, pp. 807-815
• Double P-tree: A distributed architecture for large-scale video-on-demand
  Fernando Cores, Ana Ripoll, Emilio Luque
  Lecture Notes in Computer Science 2400, 2002, pp. 816-825
• Message passing in XML-based language for creating multimedia presentations
  Stanislaw Polak, Renata Sƚota, Jacek Kitowski
  Lecture Notes in Computer Science 2400, 2002, pp. 826-829
• A parallel implementation of H.26L video encoder
  J.C. Fernández, M.P. Malumbres
  Lecture Notes in Computer Science 2400, 2002, pp. 830-833
• A novel predication scheme for a SIMD system-on-chip
  Alexander Paar, Manuel L. Anido, Nader Bagherzadeh
  Lecture Notes in Computer Science 2400, 2002, pp. 834-843
• MorphoSys: A coarse grain reconfigurable architecture for multimedia applications
  Hooman Parizi, Afshin Niktash, Nader Bagherzadeh, Fadi Kurdahi
  Lecture Notes in Computer Science 2400, 2002, pp. 844-848
• Performance scalability of multimedia instruction set extensions
  D. Cheresiz, B. Juurlink, S. Vassiliadis, H. Wijshoff
  Lecture Notes in Computer Science 2400, 2002, pp. 849-859
• Instant-access cycle-stealing for parallel applications requiring interactive response
  P.H.J. Kelly, S. Pelagatti, M. Rossiter
  Lecture Notes in Computer Science 2400, 2002, pp. 863-872
• Access time estimation for tertiary storage systems
  Darin Nikolow, Renata Sƚota, Mariusz Dziewierz, Jacek Kitowski
  Lecture Notes in Computer Science 2400, 2002, pp. 873-880
• BioGRID - Uniform platform for biomolecular applications
  Jarosƚaw Pytliński, Łukasz Skorwider, Piotr Baƚa, Miroslaw Nazaruk, Konrad Wawruch
  Lecture Notes in Computer Science 2400, 2002, pp. 881-884
• Implementing a scientific visualisation capability within a grid enabled component framework
  J. Stanton, S. Newhouse, J. Darlington
  Lecture Notes in Computer Science 2400, 2002, pp. 885-888
• Transparent fault tolerance for Web services based architectures
  Vijay Dialani, Simon Miles, Luc Moreau, Davod de Roure, Michael Luck
  Lecture Notes in Computer Science 2400, 2002, pp. 889-898
• Algorithm design and performance prediction in a Java-based Grid system with skeletons
  Martin Alt, Holger Bischof, Sergei Gorlatch
  Lecture Notes in Computer Science 2400, 2002, pp. 899-906
• A scalable approach to network enabled servers
  Eddy Caron, Frédéric Desprez, Frédéric Lombard, Jean-Marc Nicod, Laurent Philippe, Martin Quinson, Frédéric Suter
  Lecture Notes in Computer Science 2400, 2002, pp. 907-910
• Parallel distance-k coloring algorithms for numerical optimization
  Assefaw Hadish Gebremedhin, Fredrik Manne, Alex Pothen
  Lecture Notes in Computer Science 2400, 2002, pp. 912-921
• A parallel GRASP heuristic for the 2-path network design problem
  Celso C. Ribeiro, Isabel Rosseti
  Lecture Notes in Computer Science 2400, 2002, pp. 922-926
• MALLBA: A library of skeletons for combinatorial optimisation
  E. Alba, F. Almeida, M. Blesa, J. Cabeza, C. Cotta, M. Díaz, I. Dorta, J. Gabarró, C. León, J. Luna, L. Moreno, C. Pablos, J. Petit, A. Rojas, F. Xhafa
  Lecture Notes in Computer Science 2400, 2002, pp. 927-932
• Distributed maintenance of resource efficient wireless network topologies
  Matthias Grünewald, Tamás Lukovszki, Christian Schindelhauer, Klaus Volbert
  Lecture Notes in Computer Science 2400, 2002, pp. 935-946
• A local decision algorithm for maximum lifetime in ad hoc networks
  Andrea Clematis, Daniele D'Agostino, Vittoria Gianuzzi
  Lecture Notes in Computer Science 2400, 2002, pp. 947-956
• A performance study of distance source routing based protocols for mobile and wireless ad hoc networks
  Azzedine Boukerche, Joseph Linus, Agarwal Saurabha
  Lecture Notes in Computer Science 2400, 2002, pp. 957-964