Sciweavers

5005 search results - page 583 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
HPDC
1998
IEEE
15 years 11 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon
ICDCS
2010
IEEE
15 years 10 months ago
LT Network Codes
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...
ARTS
1997
Springer
15 years 10 months ago
The Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
Sérgio Vale Aguiar Campos, Edmund M. Clarke
DEBS
2008
ACM
15 years 8 months ago
Distributed automatic service composition in large-scale systems
Automatic service composition is an active research area in the field of service computing. This paper presents a distributed approach to automatically discover a composition of s...
Songlin Hu, Vinod Muthusamy, Guoli Li, Hans-Arno J...
CAGD
2004
121views more  CAGD 2004»
15 years 6 months ago
A conjecture on tangent intersections of surface patches
This note conjectures that if two surface patches intersect with G1 continuity along an entire curve, the probability is one that the curve is rational. This idea has significance...
Thomas W. Sederberg, Jianmin Zheng, Xiaowen Song