Sciweavers

4438 search results - page 562 / 888
» The Case for Collaborative Programming
Sort
View
ICALP
2003
Springer
15 years 12 months ago
Degree Distribution of the FKP Network Model
Recently, Fabrikant, Koutsoupias and Papadimitriou [7] introduced a natural and beautifully simple model of network growth involving a trade-off between geometric and network obje...
Noam Berger, Béla Bollobás, Christia...
COMPSAC
2002
IEEE
15 years 11 months ago
WWM: A Practical Methodology for Web Application Modeling
Web applications are becoming more complex and the way to manage that complexity is to model them. This paper presents a methodology to model Web applications directly from the ob...
Chanwit Kaewkasi, Wanchai Rivepiboon
INFOCOM
2002
IEEE
15 years 11 months ago
Clock Synchronization Algorithms for Network Measurements
Abstract—Packet delay traces are important measurements for analyzing end-to-end performance and for designing traffic control algorithms in computer networks. Due to the fact t...
Li Zhang, Zhen Liu, Cathy H. Xia
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
15 years 11 months ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
WDAG
2001
Springer
122views Algorithms» more  WDAG 2001»
15 years 11 months ago
Computation Slicing: Techniques and Theory
We generalize the notion of slice introduced in our earlier paper [6]. A slice of a distributed computation with respect to a global predicate is the smallest computation that cont...
Neeraj Mittal, Vijay K. Garg