2370 search results - page 47 / 474 » A Structured Set of Higher-Order Problems |
ENDM
2010
13 years 9 months ago
2010
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
ORL
2011
13 years 3 months ago
2011
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
DAM
2006
13 years 9 months ago
2006
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
BMCBI
2010
13 years 9 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
PREMI
2005
Springer
14 years 2 months ago
2005
Springer
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...