1225 search results - page 86 / 245 » The Instance Complexity Conjecture |
104
Voted
COCO
2006
Springer
15 years 6 months ago
2006
Springer
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
117
click to vote
AAAI
2007
15 years 5 months ago
2007
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
100
Voted
AAAI
2007
15 years 5 months ago
2007
We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorith...
81
Voted
AAAI
2004
15 years 4 months ago
2004
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
111
Voted
ALENEX
2004
15 years 4 months ago
2004
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...