Sciweavers

1977 search results - page 359 / 396
» The satisfactory partition problem
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
INFOCOM
2000
IEEE
14 years 2 months ago
QoS Routing with Performance-Dependent Costs
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
Funda Ergün, Rakesh K. Sinha, Lisa Zhang
SIGMETRICS
1998
ACM
14 years 2 months ago
Scheduling Policies to Support Distributed 3D Multimedia Applications
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
Thu D. Nguyen, John Zahorjan
CEC
2009
IEEE
14 years 1 months ago
Towards connectivity improvement in VANETs using bypass links
VANETs are ad hoc networks in which devices are vehicles moving at high speeds. This kind of network is getting more and more importance since it has many practical and important a...
Bernabé Dorronsoro Díaz, Patricia Ru...
COMPGEOM
2007
ACM
14 years 1 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir