Sciweavers

252 search results - page 5 / 51
» On partitions of discrete boxes
Sort
View
CIIA
2009
13 years 8 months ago
Appling A Discrete Particle Swarm Optimization Algorithm to Database Vertical Partition
Vertical partition is an important technique in database design used to enhance performance in database systems. Vertical fragmentation is a combinatorial optimization problem that...
Bilal Benmessahel, Mohamed Touahria
WSCG
2001
124views more  WSCG 2001»
13 years 9 months ago
Occlusion Evaluation in Hierarchical Radiosity
In any hierarchical radiosity method, the most expensive part is the evaluation of the visibility. Many methods use sampling and ray casting to determine this term. Space partitio...
Yann Dupuy, Mathias Paulin, René Caubet
COMBINATORICS
2004
54views more  COMBINATORICS 2004»
13 years 7 months ago
When Can You Tile a Box With Translates of Two Given Rectangular Bricks?
When can a d-dimensional rectangular box R be tiled by translates of two given d-dimensional rectangular bricks B1 and B2? We prove that R can be tiled by translates of B1 and B2 ...
Richard J. Bower, T. S. Michael
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
14 years 1 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...
QSIC
2008
IEEE
14 years 1 months ago
Using Machine Learning to Refine Black-Box Test Specifications and Test Suites
In the context of open source development or software evolution, developers are often faced with test suites which have been developed with no apparent rationale and which may nee...
Lionel C. Briand, Yvan Labiche, Zaheer Bawar