Sciweavers

4131 search results - page 249 / 827
» Compactness in Topology and Computation
Sort
View
CCA
2009
Springer
16 years 1 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
ICPPW
2002
IEEE
15 years 11 months ago
A Programming Methodology for Designing Block Recursive Algorithms on Various Computer Networks
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms on various computer networks. In our previ...
Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung
TELETRAFFIC
2007
Springer
16 years 21 days ago
Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach
Abstract— Paths with loops, even transient ones, pose significant stability problems in high-speed networks. We present a new algorithm, named Distributed Path Computation with ...
Saikat Ray, Roch Guérin, Rute Sofia
IPTPS
2004
Springer
15 years 12 months ago
Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet
— Peer-to-peer computing, the harnessing of idle compute cycles throughout the Internet, offers exciting new research challenges in the converging domains of networking and distr...
Virginia Mary Lo, Daniel Zappala, Dayi Zhou, Yuhon...
SDM
2009
SIAM
180views Data Mining» more  SDM 2009»
16 years 3 months ago
Structure and Dynamics of Research Collaboration in Computer Science.
Complex systems exhibit emergent patterns of behavior at different levels of organization. Powerful network analysis methods, developed in physics and social sciences, have been s...
Andre Nash, Christian Bird, Earl T. Barr, Premkuma...