15494 search results - page 228 / 3099 » Computing dynamic clusters |
136
click to vote
PPSN
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
181
click to vote
MVA
1996
15 years 8 months ago
1996
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
170
click to vote
KESAMSTA
2010
Springer
15 years 4 months ago
2010
Springer
Computational Trust and Reputation (CTR) systems are essential in electronic commerce to encourage interactions and suppress deceptive behaviours. This paper focus on comparing two...
174
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem...
146
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a hardware mechanism which dynamically detects uniform and affine vectors used in Graphics Processing Units, to minimize pressure on the register file and redu...