4940 search results - page 753 / 988 » On the Complexity of Universal Programs |
160
click to vote
CPAIOR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...
195
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
151
click to vote
COR
2008
15 years 6 months ago
2008
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, ...
160
click to vote
COR
2008
15 years 6 months ago
2008
This paper presents a tabu search metaheuristic algorithm for the automatic generation of structural software tests. It is a novel work since tabu search is applied to the automat...
139
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditio...