15485 search results - page 541 / 3097 » Computing Optimal Subsets |
225
click to vote
SMA
1999
ACM
15 years 11 months ago
1999
ACM
We present an efficient algorithm for preserving the total volume of a solids undergoing free-form deformation using discrete level-of-detail representations. Given the boundary r...
206
click to vote
RTSS
1999
IEEE
15 years 11 months ago
1999
IEEE
Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and a...
211
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
173
click to vote
EENERGY
2010
15 years 11 months ago
2010
Sleeping is an important method to reduce energy consumption in many information and communication systems. In this paper we focus on a typical server under dynamic load, where en...
183
click to vote
CATS
2007
15 years 8 months ago
2007
For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the ...