925 search results - page 23 / 185 » A Solution to the Extended GCD Problem |
156
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
137
click to vote
AAAI
2000
15 years 5 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
142
click to vote
EDBT
2000
ACM
15 years 7 months ago
2000
ACM
The management and query processing of one dimensional intervals is a special case of extended object handling. One dimensional intervals play an important role in temporal databa...
137
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
240
click to vote
CPAIOR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...