Sciweavers

652 search results - page 77 / 131
» Optimization problems involving collections of dependent obj...
Sort
View
VLDB
1998
ACM
101views Database» more  VLDB 1998»
14 years 1 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...
MASCOTS
2003
13 years 10 months ago
Minimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
Hema Tahilramani Kaur, Tao Ye, Shivkumar Kalyanara...
EDBT
2000
ACM
14 years 1 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
PG
1999
IEEE
14 years 1 months ago
Subdivision Surface Fitting to a Range of Points
The objective of this research is to apply the subdivision surface for surface fitting problems when generating surfaces from data points or polyhedral models. The basic idea is t...
Hiromasa Suzuki, Shingo Takeuchi, Fumihiko Kimura,...
AAAI
2007
13 years 11 months ago
An Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli