1144 search results - page 110 / 229 » Logic programming for combinatorial problems |
100
click to vote
DLOG
2003
15 years 4 months ago
2003
We consider the problem of automated index selection for embedded control programs (ECPs). Such systems have the property that the transaction types, which can consist of queries ...
121
Voted
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
107
Voted
AAAI
1998
15 years 4 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
137
Voted
PLDI
2009
ACM
15 years 9 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
133
click to vote
IWOMP
2009
Springer
15 years 9 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...