8825 search results - page 191 / 1765 » All for one or one for all |
117
click to vote
IVC
2007
15 years 1 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
100
click to vote
TPDS
2008
15 years 1 months ago
2008
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
110
Voted
JCO
2000
15 years 1 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
108
click to vote
PRESENCE
2000
15 years 1 months ago
2000
A between-group experiment was carried out to assess whether two different presence questionnaires can distinguish between real and virtual experiences. One group of 10 subjects s...
ML
2002
ACM
15 years 1 months ago
2002
ACM
Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while t...