1547 search results - page 24 / 310 » Solving Knapsack Problems in a Sticker Based Model |
CADE
2012
Springer
11 years 10 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Integer Linear Programming (ILP) and Genetic Algori...
SIGCSE
2000
ACM
13 years 12 months ago
2000
ACM
The paper elucidates two views (models) of algorithmic problem solving. The first one is static; it is based on the identification of several principal dimensions of algorithmic p...
ECAI
1990
Springer
13 years 11 months ago
1990
Springer
In case-based reasoning (CBR) a problem is solved by matching the problem description to a previously solved case, using the past solution in solving the new problem. A case-based...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...