Sciweavers

3791 search results - page 6 / 759
» Packing sets of patterns
Sort
View
COR
2008
133views more  COR 2008»
13 years 7 months ago
A new constraint programming approach for the orthogonal packing problem
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...
François Clautiaux, Antoine Jouglet, Jacque...
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 27 days ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 1 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
14 years 1 months ago
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
Leah Epstein, Rob van Stee
ACL
1998
13 years 8 months ago
Ambiguity Preserving Machine Translation using Packed Representations
In this paper we present an ambiguity preserving translation approach which transfers ambiguous LFG f-structure representations. It is based on packed f-structure representations ...
Martin C. Emele, Michael Dorna