Buch, Englisch, Band 3104, 303 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1000 g
11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Proceedings
Buch, Englisch, Band 3104, 303 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1000 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-22230-9
Verlag: Springer Berlin Heidelberg
acknowledgethe e?ort of all authors who submitted their contributions.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Computerkommunikation & -vernetzung
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
- Mathematik | Informatik EDV | Informatik Technische Informatik Externe Speicher & Peripheriegeräte
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
Weitere Infos & Material
Traffic Grooming in a Passive Star WDM Network.- The Price of Anarchy in All-Optical Networks.- Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks.- Path Layout on Tree Networks: Bounds in Different Label Switching Models.- On Approximability of the Independent Set Problem for Low Degree Graphs.- Asynchronous Broadcast in Radio Networks.- Two-Hop Virtual Path Layout in Tori.- Robot Convergence via Center-of-Gravity Algorithms.- F-Chord: Improved Uniform Routing on Chord.- Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor.- Improved Bounds for Optimal Black Hole Search with a Network Map.- Sparse Additive Spanners for Bounded Tree-Length Graphs.- No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes.- Existence of Nash Equilibria in Selfish Routing Problems.- Mobile Agents Rendezvous When Tokens Fail.- Time Efficient Gossiping in Known Radio Networks.- Long-Lived Rambo: Trading Knowledge for Communication.- Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach.- Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks.- Perfect Token Distribution on Trees.- Approximation Algorithm for Hotlink Assignment in the Greedy Model.- Optimal Decision Strategies in Byzantine Environments.- Sharing the Cost of Multicast Transmissions in Wireless Networks.- NP-Completeness Results for All-Shortest-Path Interval Routing.- On-Line Scheduling of Parallel Jobs.- The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces.
