297 search results - page 27 / 60 » et 2002 |
STOC
2002
ACM
14 years 10 months ago
2002
ACM
In the dynamic load balancing problem, we seek to keep the job load roughly evenly distributed among the processors of a given network. The arrival and departure of jobs is modeled...
ICSM
2002
IEEE
14 years 2 months ago
2002
IEEE
We present an empirical evaluation of three contextsensitive slicing algorithms and five context-sensitive chopping algorithms, and compare them to context-insensitive methods. B...
BMVC
2002
14 years 8 days ago
2002
An experimental comparative study between two representation methods for the recognition of 3D objects from a 2D view is carried out. The two methods compared are our ARG region-b...
ANOR
2002
13 years 9 months ago
2002
This paper provides the asymptotic analysis of the loss probability in the GI/M/1/n queueing system as n increases to infinity. The approach of this paper is alternative to that of...
TCS
2002
13 years 9 months ago
2002
A real is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals. A real is random if its binary expansion is a random sequence. Ou...