Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
What's In An Algorithm?, George K. Thiruvathukal
What's In An Algorithm?, George K. Thiruvathukal
Computer Science: Faculty Publications and Other Works
How can we rethink the definition of algorithm, and through that, produce another age of enlightenment in modern scientific programming and software development in general? Removing these limitations in our own thoughts is the key for expanding the possibilities in alternative paradigms and exploiting parallel and next-generation hardware.
Pdc Modules For Every Level: A Comprehensive Model For Incorporating Pdc Topics Into The Existing Undergraduate Curriculum, Konstantin Läufer, Chandra N. Sekharan, George K. Thiruvathukal
Pdc Modules For Every Level: A Comprehensive Model For Incorporating Pdc Topics Into The Existing Undergraduate Curriculum, Konstantin Läufer, Chandra N. Sekharan, George K. Thiruvathukal
Computer Science: Faculty Publications and Other Works
We propose to give a half-hour presentation on incorporating PDC topics into our existing undergraduate computer science curriculum. We first describe our experience with single-course and cross-curricular undergraduate PDC education since 1997. We then provide details about our proposed model for incorporating PDC topics into our undergraduate curriculum. To this end, we have distilled a set of consistent, regularly offered and required three-week core and advanced PDC modules from our previously offered PDC content.
An Exceptionally Useful Exploration, George K. Thiruvathukal
An Exceptionally Useful Exploration, George K. Thiruvathukal
Computer Science: Faculty Publications and Other Works
A book review for Computing in Science and Engineering by D. Easley and J. Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly-Connected World, Cambridge Univ. Press, 2010, ISBN: 978-0-521-1953-1, 736 pp.
Packet Routing In Networks With Long Wires, Ronald I. Greenberg, Hyeong-Cheol Oh
Packet Routing In Networks With Long Wires, Ronald I. Greenberg, Hyeong-Cheol Oh
Computer Science: Faculty Publications and Other Works
In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem in a network independent context, in which routing time is expressed in terms of "congestion" and "dilation" measures for a set of packet paths. We give, for any constant ϵ > 0, a randomized on-line algorithm for routing any set of Npackets in O((C lgϵ(Nd) + D lg(Nd))/lg lg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into …