Sciweavers

299 search results - page 48 / 60
» Optimizing Polynomial Solvers for Minimal Geometry Problems
Sort
View
VLDB
1998
ACM
101views Database» more  VLDB 1998»
13 years 11 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
MOBIQUITOUS
2007
IEEE
14 years 1 months ago
Optimal Relay Node Fault Recovery
—Topology control problems are concerned with the assignment of power levels to the nodes of an ad-hoc network so as to maintain a specified network topology while minimizing th...
Fei Che, Liang Zhao, Errol L. Lloyd
CPAIOR
2005
Springer
14 years 1 months ago
Constraint Programming Based Column Generation for Employee Timetabling
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
HYBRID
2007
Springer
14 years 1 months ago
Optimal Switches in Multi-inventory Systems
Given a switched multi–inventory system we wish to find the optimal schedule of the resets to maintain the system in a safe operating interval, while minimizing a function relat...
Dario Bauso
CAAN
2006
Springer
13 years 11 months ago
Distributed Routing in Tree Networks with Few Landmarks
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
Ioannis Z. Emiris, Euripides Markou, Aris Pagourtz...