4940 search results - page 61 / 988 » On the Complexity of Universal Programs |
128
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
165
click to vote
BTW
1997
Springer
15 years 8 months ago
1997
Springer
Database systems as basis for CAD frameworks have to provide data management as well as transaction management facilities meeting the requirements of design applications. One of t...
142
click to vote
SIAMJO
2010
15 years 2 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
128
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We consider the tile self-assembly model and how tile complexity can be eliminated by permitting the temperature of the self-assembly system to be adjusted throughout the assembly...
124
Voted
MOR
2002
15 years 3 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...