1225 search results - page 106 / 245 » The Instance Complexity Conjecture |
HPCC
2007
Springer
14 years 3 months ago
2007
Springer
Currently some complex grid applications developing often need orchestrate multiple diverse grid services into a workflow of tasks that can submit for executing on the grid environ...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
CP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Much progress has been made in terms of boosting the effectiveness of backtrack style search methods. In addition, during the last decade, a much better understanding of ...
SSDBM
2003
IEEE
14 years 2 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
IWSSD
2000
IEEE
14 years 1 months ago
2000
IEEE
We seek to facilitate development of high quality software designs and architectures by using rigorous process definitions to guide application of the complex structure of relati...