175 search results - page 31 / 35 » Lower Bounds for Dynamic Algebraic Problems |
ALGORITHMICA
2004
13 years 7 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
ISQED
2007
IEEE
14 years 1 months ago
2007
IEEE
— In the past, dynamic voltage and frequency scaling (DVFS) has been widely used for power and energy optimization in embedded system design. As thermal issues become increasingl...
CIAC
1994
Springer
13 years 11 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...