Sciweavers

3702 search results - page 484 / 741
» All Pairings Are in a Group
Sort
View
206
Voted
ICC
2007
IEEE
106views Communications» more  ICC 2007»
16 years 1 months ago
A Distributed Approach to End-to-End Network Topology Inference
Abstract— To construct an efficient overlay network, the information of underlay is important. However, the inference of an underlay topology is not easy. We consider using end-...
Xing Jin, Qiuyan Xia, Shueng-Han Gary Chan
OTM
2005
Springer
16 years 6 days ago
Document Flow Model: A Formal Notation for Modelling Asynchronous Web Services Composition
This paper presents a formal notation for modelling asynchronous web services composition, using context and coordination mechanisms. Our notation specifies the messages that can b...
Jingtao Yang, Corina Cîrstea, Peter Henderso...
CSCW
2004
ACM
16 years 4 days ago
Learning from project history: a case study for software development
The lack of lightweight communication channels and other technical and sociological difficulties make it hard for new members of a non-collocated software development team to lea...
Davor Cubranic, Gail C. Murphy, Janice Singer, Kel...
ICWE
2003
Springer
15 years 12 months ago
Semi-automatic Assessment Process in a Ubiquitous Environment for Language Learning
This work presents a research on the methods and mechanisms necessary to bring the Information and Communication Technologies in the traditional classroom. This will be achieved by...
Maximiliano Paredes, Manuel Ortega, Pedro P. S&aac...
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 10 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...