Results 1  10
of
1,032
The R+tree: A dynamic index for multidimensional objects
 PROC. 13TH VLDB CONF
, 1987
"... The problem of indexing multidimensional objects is considered. First, a classification of existing methods is given along with a discussion of the major issues involved in multidimensional data indexing. Second, a variation to Guttman’s Rtrees (R +trees) that avoids overlapping rectangles in inte ..."
Abstract

Cited by 345 (19 self)
 Add to MetaCart
in intermediate nodes of the tree is introduced. Algorithms for searching, updating, initial packing and reorganization of the structure are discussed in detail. Finally, we provide analytical results indicating that R +trees achieve up to 50 % savings in disk accesses compared to an Rtree when searching files
The R + tree: A dynamic index for multidimensional objects
, 1987
"... The problem of indexing multidimensional objects is considered. First, a classification of existing methods is given along with a discussion of the major issues involved in multidimensional data indexing. Second, a variation to Guttman’s Rtrees (R +trees) that avoids overlapping rectangles in inte ..."
Abstract

Cited by 303 (33 self)
 Add to MetaCart
in intermediate nodes of the tree is introduced. Algorithms for searching, updating, initial packing and reorganization of the structure are discussed in detail. Finally, we provide analytical results indicating that R +trees achieve up to 50 % savings in disk accesses compared to an Rtree when searching files
Direct spatial search on pictorial databases using packed rtrees
 Proc. ACM SIGMOD
, 1985
"... Pictorial databases require efficient and duect spatml search based on the analog form of spatial obJects and relatlonshlps instead of search based on some cumbersome alphanumeric encodings of the pmtures Rtrees (twodimensional Btrees) are excellent devices for indexing spatial ObJects and relati ..."
Abstract

Cited by 153 (8 self)
 Add to MetaCart
Jects and relationships found on pictures Their most important feature 1s that they provide high level ObJect onented search rather than search based on the low level elements of spatial ObJects This paper presents an efficient initial packing technique for creatmg Rtrees to index spatial ObJects Since pictorial
A power controlled multiple access protocol for wireless packet networks
, 2001
"... Abstract — Multiple accessbased collision avoidance MAC protocols have typically used fixed transmission power, and have not considered power control mechanisms based on the distance of the transmitter and receiver in order to improve spatial channel reuse. This work proposes PCMA, a power controll ..."
Abstract

Cited by 242 (2 self)
 Add to MetaCart
networks and does not require the presence of base stations to manage transmission power (i.e. it is decentralized). The advantage of implementing a power controlled protocol in an adhoc network is that sourcedestination pairs can be more tightly packed into the network allowing a greater number
Influence of initial block packing on rock avalanche flow and emplacement mechanisms through FEM/DEM simulations
"... ABSTRACT The importance of the initial packing of a rock cumulus on its flow process and emplacement mechanism has been highlighted by several smallscale experiments ..."
Abstract
 Add to MetaCart
ABSTRACT The importance of the initial packing of a rock cumulus on its flow process and emplacement mechanism has been highlighted by several smallscale experiments
Optimal rectangle packing: Initial results
 In Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS2003
"... Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks can be modelled by this NPcomplete problem. We use an anytime branchandbound algorithm to solve the problem optimally. Our ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
. Our main contributions are a lowerbound on the amount of wasted space in a partial solution, based on a relaxation of the problem to onedimensional bin packing, and a dominance condition that allows us to ignore many partial solutions. For our experiments, we choose a class of increasingly difficult
Orienting Polygonal Parts without Sensors
, 1992
"... In manufacturing, it is often necessary to orient parts prior to packing or assembly. We say that a planar part is polygonal if its convex hull is a polygon. We consider the following problem: given a list of n vertices describing a polygonal part whose initial orientation is unknown, find the short ..."
Abstract

Cited by 205 (41 self)
 Add to MetaCart
In manufacturing, it is often necessary to orient parts prior to packing or assembly. We say that a planar part is polygonal if its convex hull is a polygon. We consider the following problem: given a list of n vertices describing a polygonal part whose initial orientation is unknown, find
On the packing of Selfish Items
 In: Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS
"... In the non cooperative version of the classical Minimum Bin Packing problem, an item is charged a cost according to the percentage of the used bin space it requires. We study the game induced by the selfish behavior of the items which are interested in being packed in one of the bins so as to minimi ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
as to minimize their cost. We prove that such a game always converges to a pure Nash equilibrium starting from any initial packing of the items, estimate the number of steps needed to reach one such equilibrium, prove the hardness of computing good equilibria and give an upper and a lower bound for the price
Vacuum packing: a model system for laboratoryscale silage fermentations
"... Aims: To determine the utility of vacuumpacked polythene bags as a convenient, flexible and costeffective alternative to fixed volume glass vessels for labscale silage studies. Methods and Results: Using perennial ryegrass or red clover forage, similar fermentations (as assessed by pH measurement ..."
Abstract
 Add to MetaCart
H measurement) occurred in glass tube and vacuumpacked silos over a 35day period. As vacuumpacking devices allow modification of initial packing density, the effect of four different settings (initial packing densities of 0Æ397, 0Æ435, 0Æ492 and 0Æ534 g cm)3) on the silage fermentation over 16 days
Repairing Bin Packing Constraints
"... Abstract. We consider a variant of the bin packing problem, where items are initially assigned to bins, and the goal is to rearrange the items in the minimum number of steps such that the capacity constraints are satisfied. We consider two search spaces for solving this problem, a commitmentbased s ..."
Abstract
 Add to MetaCart
Abstract. We consider a variant of the bin packing problem, where items are initially assigned to bins, and the goal is to rearrange the items in the minimum number of steps such that the capacity constraints are satisfied. We consider two search spaces for solving this problem, a commitment
Results 1  10
of
1,032