Tycho

Results: 254



#Item
21Graph connectivity / Emerging technologies / Network architecture / Computing / SIGCOMM / Stress testing / Software-defined networking / Algorithm / Reachability / OpenFlow / Mathematics / Academia

Destroying networks for fun (and profit) Nick Shelly∗§, Brendan Tschaen†, Klaus-Tycho Förster∗, Michael Chang‡, Theophilus Benson†, Laurent Vanbever∗ ∗ ETH Zürich, ‡Princeton University, †Duke Unive

Add to Reading List

Source URL: users.cs.duke.edu

Language: English - Date: 2015-12-04 11:47:25
22Gaming / Software / Computing / Parallel computing / Minecraft / Thread / Synchronization / Multithreading / Virtual world

A Concept for an Introduction to Parallelization in Java: Multithreading with Programmable Robots in Minecraft Klaus-Tycho Förster Michael König

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-07-27 12:12:30
23Astronomy / Astrology / Optical phenomena / Planetary science / Eclipses / Lunar science / Lunar eclipse / Lunar observation / Moon / Shadow / Penumbra / Tycho

Lunar Eclipse Vocabulary: Would you like to see giant craters blasted by asteroids, vast seas of hardened lava and eerie abandoned spaceships? Take a tour of our Moon. This week is a great time to do it. The

Add to Reading List

Source URL: www.skycalls.org

Language: English - Date: 2007-02-13 00:01:27
24Observational astronomy / Apparent magnitude / Lowell Observatory Near-Earth-Object Search / Magnitude / HR 178 / Tycho-2 Catalogue

DERIVING A V MAGNITUDE FROM UCAC3 Hristo Pavlov ABSTRACT The LONEOS photometric catalogue is a compilation by Brian Skiff that contains the V magnitudes of more than 17,000 standard stars. The catalogue contains stars fr

Add to Reading List

Source URL: www.hristopavlov.net

Language: English - Date: 2014-01-14 08:44:36
25Complexity classes / Distributed computing / NP / Computational complexity theory / P / NC

Local Checkability, No Strings Attached Klaus-Tycho Förster, Thomas Lüdi, Jochen Seidel, Roger Wattenhofer Wednesday – December 09, 2015 @MIT: Theory of Distributed Systems Group ETH Zurich – Distributed Computing

Add to Reading List

Source URL: www.disco.ethz.ch

Language: English - Date: 2015-12-14 03:34:43
26Complexity classes / Distributed computing / NP / Computational complexity theory / P / NC

Local Checkability, No Strings Attached Klaus-Tycho Förster, Thomas Lüdi, Jochen Seidel, Roger Wattenhofer January 06, 2016 @ ICDCNSingapore ETH Zurich – Distributed Computing – www.disco.ethz.ch

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-01-06 03:53:49
27Graph connectivity / Failure / Emerging technologies / Network architecture / SIGCOMM / Stress testing / Software-defined networking / Algorithm / Reachability / Reliability engineering

Destroying networks for fun (and profit) Nick Shelly∗§, Brendan Tschaen†, Klaus-Tycho Förster∗, Michael Chang‡, Theophilus Benson†, Laurent Vanbever∗ ∗ ETH Zürich, ‡Princeton University, †Duke Unive

Add to Reading List

Source URL: vanbever.eu

Language: English - Date: 2015-10-30 21:51:01
28Network flow / Graph theory / Mathematics / Operations research / Flow network / Multi-commodity flow problem / Maximum flow problem / Max-flow min-cut theorem / Traffic flow / Linear programming / Approximate max-flow min-cut theorem / Circulation problem

On Consistent Migration of Flows in SDNs Sebastian Brandt Klaus-Tycho Foerster∗ Roger Wattenhofer

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-01-21 09:22:35
29Routing algorithms / Network management / Computing / Routing protocols / Network architecture / Routing / Link-state routing protocol / Routing loop problem / Temporally ordered routing algorithm / Wireless Routing Protocol

Consistent Updates in Software Defined Networks: On Dependencies, Loop Freedom, and Blackholes Klaus-Tycho F¨orster Ratul Mahajan

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-04-01 04:36:10
30Graph theory / Mathematics / Combinatorial optimization / Edsger W. Dijkstra / Routing algorithms / Search algorithms / NP-complete problems / Graph traversal / Shortest path problem / Matching / A* search algorithm / Planar graph

Lower and Upper Competitive Bounds for Online Directed Graph ExplorationI Klaus-Tycho Foerstera,1,∗, Roger Wattenhofera a ETH Z¨

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-02-08 07:16:33
UPDATE