16504 search results - page 7 / 3301 » New Problems, New Solutions |
108
click to vote
COR
2008
14 years 12 months ago
2008
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 ...
127
click to vote
SAC
2011
ACM
14 years 3 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
106
click to vote
EVOW
2000
Springer
15 years 3 months ago
2000
Springer
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...
LPAR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...
118
click to vote
CAEPIA
2003
Springer
15 years 5 months ago
2003
Springer
The Partitioning problem is a key issue in the design of Distributed Virtual Environment (DVE) systems based on a server-network architecture. This problem consist of efficiently ...