1494 search results - page 285 / 299 » Less Extreme Programming |
114
click to vote
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
107
click to vote
SIGECOM
2003
ACM
15 years 7 months ago
2003
ACM
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
110
Voted
SIGMETRICS
2003
ACM
15 years 7 months ago
2003
ACM
The increasing constraints on power consumption in many computing systems point to the need for power modeling and estimation for all components of a system. The Operating System ...
138
Voted
SIGUCCS
2003
ACM
15 years 7 months ago
2003
ACM
This paper is an account of some of the more instructive experiences we gained as we sought to ensure that our information technology training programs kept pace with a fast chang...
103
click to vote
BIRTHDAY
2003
Springer
15 years 7 months ago
2003
Springer
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...