2635 search results - page 20 / 527 » Algorithms for the Database Layout Problem |
153
click to vote
EOR
2007
15 years 2 months ago
2007
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
107
Voted
EOR
2006
15 years 2 months ago
2006
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
118
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
119
click to vote
VDB
1998
15 years 3 months ago
1998
Any graphical user interface (GUI) requires large amounts of complex metadata for the layout of windows and menus, their style and behavior, their bindings, etc. Designing, debugg...
131
click to vote
MP
1998
15 years 2 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...