Sciweavers

74 search results - page 7 / 15
» Problem Generators for Rectangular packing problems
Sort
View
IJCAI
2003
13 years 8 months ago
An Improved Algorithm for Optimal Bin Packing
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
Richard E. Korf
AAAI
2006
13 years 8 months ago
The Impact of Balancing on Problem Hardness in a Highly Structured Domain
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
Carlos Ansótegui, Ramón Béjar...
CP
2001
Springer
13 years 12 months ago
A CLP Approach to the Protein Side-Chain Placement Problem
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
Martin T. Swain, Graham J. L. Kemp
PDPTA
2007
13 years 9 months ago
Suppressing Independent Loops in Packing/Unpacking Loop Nest to Reduce Message Size for Message-passing Code
- In this paper we experiment with two optimization techniques we are considering implementing in a parallelizing compiler that generates parallel code for a distributed-memory sys...
P. Jerry Martin, Clayton S. Ferner
VISUALIZATION
1998
IEEE
13 years 11 months ago
A general method for preserving attribute values on simplified meshes
Many sophisticated solutions have been proposed to reduce the geometric complexity of 3D meshes. A less studied problem is how to preserve on a simplified mesh the detail (e.g. co...
Paolo Cignoni, Claudio Montani, Roberto Scopigno, ...