8540 search results - page 1500 / 1708 » The Dynamic Servers Problem |
135
Voted
CP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
137
Voted
WOMPAT
2001
Springer
15 years 8 months ago
2001
Springer
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...
127
Voted
AUIC
2000
IEEE
15 years 8 months ago
2000
IEEE
Electronic Blocks are a new programming interface, designed for children aged between three and eight years. The Electronic Blocks programming environment includes sensor blocks, ...
137
Voted
HICSS
2000
IEEE
15 years 8 months ago
2000
IEEE
We address the problem of message ordering for reliable multicast communication. End-to-end multicast ordering is useful for ensuring the collective integrity and consistency of d...
131
Voted
ICDCS
2000
IEEE
15 years 8 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....