4266 search results - page 261 / 854 » The container loading problem |
143
click to vote
IJCAI
2003
15 years 6 months ago
2003
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 ...
164
click to vote
IJCAI
2003
15 years 6 months ago
2003
In traditional text classification, a classifier is built using labeled training documents of every class. This paper studies a different problem. Given a set P of documents of a ...
126
click to vote
AAAI
2000
15 years 6 months ago
2000
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam...
149
click to vote
AAAI
2000
15 years 6 months ago
2000
This paper addresses the problem of tracking and diagnosing complex systems with mixtures of discrete and continuous variables. This problem is a difficult one, particularly when ...
113
click to vote
IJCAI
1993
15 years 5 months ago
1993
We introduce a new approach to GA (Genetic Algorithms) based problem solving. Earlier GAs did not contain local search (i.e. hill climbing) mechanisms, which led to optimization d...